首页 > 代码库 > Remove Duplicates from Sorted Array II
Remove Duplicates from Sorted Array II
Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?
For example,
Given sorted array A = [1,1,1,2,2,3],
Your function should return length = 5, and A is now [1,1,2,2,3].
class Solution {
public:
int removeDuplicates(int A[], int n)
{
if(n<=2) return n;
int index=0;
int index2=0;
while(index2<n)
{
A[index++]=A[index2++];
if(index2<n && A[index2]==A[index-1])
A[index++]=A[index2++];
while(index2<n && A[index2]==A[index-1])
index2++;
}
return index;
}
};
public:
int removeDuplicates(int A[], int n)
{
if(n<=2) return n;
int index=0;
int index2=0;
while(index2<n)
{
A[index++]=A[index2++];
if(index2<n && A[index2]==A[index-1])
A[index++]=A[index2++];
while(index2<n && A[index2]==A[index-1])
index2++;
}
return index;
}
};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。