[leetcode]Remove Duplicates from Sorted Array

Remove Duplicates from Sorted Array

  Total Accepted: 57505  Total Submissions: 182307 My Submissions

Question  Solution 

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

For example,
Given input array A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

不能开辟内存啊！！！

所以只能从前到后扫描了，将前一个数据记录到pre中，如果重复了则进行重复处理，没有就继续往后扫描。

但是有一个问题就是当重复发生后，要将后面的数据往前移动。

// test26RemoveDuplicatesfromSortedArray.cpp : 定义控制台应用程序的入口点。
//


#include "stdafx.h"
int removeDuplicates(int a[], int n);




int _tmain(int argc, _TCHAR* argv[])
{
int a[] = { 1, 2, 3, 3, 3, 3, 5, 5, 5, 5, 7 };
int n = removeDuplicates(a, 11);
return 0;
}


int removeDuplicates(int a[], int n) 
{
int repeatNum = 0;
int start = 0;
int pre;
if (n < 2)
return n;
pre = a[0];
for (int i = 1; i < n-repeatNum; i++)
{
if (repeatNum == 0)
{
if (a[i] == pre)
{
repeatNum++;
while (a[i + 1] == pre && (i + 1)< n - repeatNum)
{
i++;
repeatNum++;
}
i -= repeatNum;
}
else
{
pre = a[i];
}
}
else
{
if (a[i + repeatNum] == pre)
{
start = i;
repeatNum++;
while (a[i  + repeatNum] == pre && (i + 1 + repeatNum)< n )
{
repeatNum++;
}


i = i - 1;


}
else
{
a[i] = a[i + repeatNum];
pre = a[i];
}





}
}
return n - repeatNum;
}