Remove Duplicates from Sorted Array

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].

题目解析：

（1）只要利用一个count记住重复的个数就可以，这样后面的元素就知道向前面移动几个。

#include <iostream>

using namespace std;

int removeDuplicates(int A[], int n) {
	int count = 0;

	for(int i=1;i<n;i++)
	{
		if(A[i] == A[i-1])
			count++;

		else{
			A[i-count] = A[i];
		}
	}

	return (n-count);
}

int main(void)
{
	int A[] = {1,1,2,2,3,3,3,4};

	int remain = removeDuplicates(A, 8);

	cout << remain << endl;

	for(int i=0;i<remain;i++)
	{
		cout << A[i] << " ";
	}
	cout << endl;

	system("pause");
	return 0;
}