题意理解为实现STL的unique函数
难度:3
看代码更易理解,挺短的,O(n)
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.
if(n == 0) return 0;
int cur=A[0];
int num=1;
for(int i=1;i<n;i++)
{
if(A[i] == cur)
{
continue;
}
cur=A[i];
A[num++]=A[i];
}
return num;
}
};