和大神们学习每天一题(leetcode)-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].

<pre name="code" class="cpp">class Solution 
{
public:
	int removeDuplicates(int A[], int n) 
	{
		if (n < 2)//如果输入数组长度小于2则不需要查重
			return n;
		int nSeqEnd = 1;//复制标记处
		for (int nTemp = 0; nTemp < n - 1; nTemp++)//从第二个元素开始遍历数组中所有元素
		{
			if (A[nTemp] != A[nTemp + 1])//如果当前元素的值和前一个元素的值不相等则将当前值复制到标记处
			{
				A[nSeqEnd] = A[nTemp + 1];
				nSeqEnd++;//标记加1
			}
		}
		return nSeqEnd;
	}
};