Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
For example,
Given input array nums = [1,1,2],
Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn’t matter what you leave beyond the new length.
public class Solution {
public int removeDuplicates(int[] nums) {
HashSet set = new HashSet();
int m=0;
for(int i=0;i<nums.length;i++){
if(set.add(nums[i])){
nums[m] = nums[i];
m++;
}
}
return m;
}
}
本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注：
