标签：leetcode remove duplicates fr
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;
map<int,int>m;
for(int i=0;i<n;++i)
{
m[A[i]]++;
if(m[A[i]]<=2)//只记录两次以内的
A[index++]=A[i];
}
return index;
}
};LeetCode Remove Duplicates from Sorted Array II
标签：leetcode remove duplicates fr
原文地址：http://blog.csdn.net/wdkirchhoff/article/details/43839869
