题目:
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]
.
解题思路:设置标志位tag,判断重复个数是否超过2,代码如下:
#include "stdafx.h"
#include <iostream>
using namespace std;
int removeDuplicates(int A[], int n)
{
int tag = 0; //设置一个标志位,标志重复数是否超过2
for (int i = n-1; i>0;i--)
{
if (A[i - 1] == A[i])
{
tag++; //遇到重复数,tag加1
if (tag >= 2) //当重复个数大于2时,元素向前移动一位,n--;
{
int k = i - 1;
for (int j = i - 1; j < n; j++)
{
A[j] = A[j + 1];
}
if (k - 1 >= 0 && A[k - 1] != A[k]) //判断再往前一位是否仍是重复数,如果不是则设置tag标志为0;否则tag不变
tag = 0;
n--;
}
}
else
tag = 0; //没有重复,标志位置0;
}
return n;
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[] = { 1,1,2,2 };
cout << removeDuplicates(a, 4)<<endl;
return 0;
}