Question:
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 A = [1,1,2]
,
Your function should return length = 2
, and A is now [1,2]
.
方法:
Two Pointers,一个遍历数组,另一个指向当前不重复数组的最后一位。
遍历的指针移动速度必然不慢于另一个指针,如果遍历指针的数值和当前不重复指针数值不一样,那么表示遍历指针指向的就是下一个不重复的数值。把不重复指针位数加一,并将遍历指针的数值赋给当前不重复指针指向的位置。
Code:
public class Solution {
public int removeDuplicates(int[] A) {
// Start typing your Java solution below
// DO NOT write main() function
if(A==null || A.length==0) return 0;
int index = 0;
for(int i=0; i<A.length; i++)
if(A[i]!=A[index]){
index++;
A[index] = A[i];
}
return index+1;
}
}
总结:
难度很小的一道题,却花费了不少时间重新构思,不得不说双指针的构思很精巧,运用很灵活,经典。