class Solution {
public:
int Duplicate(int i,int A[])
{
int count=1;
for(int j=i+1;A[i]==A[j];j++)
{
count++;
}
return count;
}
int removeDuplicates(int A[], int n)
{
if(n==1)
return 1;
if(n==2)
return 2;
int length=0;
int count;
int j=0;
for(int i=0;i<n;i+=count)
{
count=Duplicate(i,A);
if(count>=2)
length+=2;
else
length+=count;
while(j<length)
A[j++]=A[i];
}
return length;
}
};
LeetCode-Remove Duplicates from Sorted Array II
最新推荐文章于 2022-04-06 16:22:53 发布