LeetCode OJ 之 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]

.

思路：

思路和代码详解参见”删除有序数组中重复的数“代码3：http://blog.csdn.net/u012243115/article/details/41076609

代码：

class Solution {
public:
int removeDuplicates(int A[], int n)
{
if(n <= 2 )
return n;
int result = 2;
for(int i = 2 ; i < n ; i++)
{
if(A[i] != A[result - 2])
A[result++] = A[i];
}
return result;
}
};