Problem Description
Thoughts
- classic two pointers
- iterate array from left to right
- one pointer for all unique values, one pointer for all values in array
Code(JAVA)
public int removeDuplicates(int[] nums) {
if(nums.length == 0)
return 0;
int indexing = 1;
for(int i = 1; i < nums.length; i++) {
if(nums[i] == nums[i-1])
continue;
nums[indexing] = nums[i];
indexing ++;
}
return indexing;
}