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]
.
//用俩下标解决,如果相等,则j右移,否则将i指向下一个并替换,j右移,A[++i] = A[j];j++;
class Solution {
public:
int removeDuplicates(int A[], int n) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
int i,j;
i=j=0;
if(n == 0)return 0;
while(j<n)
{
if(A[i] == A[j])
{
j++;
}
else
{
A[++i] = A[j];
j++;
}
}
return i+1;//长度加1
}
};