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 nums = [1,1,2],

Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.

方法：两个指针即可。代码如下：

class Solution {
public:
	int removeDuplicates(vector<int>& nums) 
	{
		if (nums.empty())
			return 0;
		int i = 0;
		
		for (int j = 1; j < nums.size();++j)
		{
			if (nums[j] != nums[i])
				nums[++i] = nums[j];
		}
		return i + 1;
	}
};

还有一题与上面的题目类似，就是数组可以重复2个元素，我是用一个变量标记是否是第一次重复，如果不是，就从后面覆盖。

题目如下：

Given sorted array nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn't matter what you leave beyond the new length.

代码如下：

class Solution {
public:
	int removeDuplicates(vector<int>& nums) 
	{
		if (nums.empty())
			return 0;

		int i = 0;
		bool firstDuplicate = false;

		for (int j = 1; j < nums.size();++j)
		{
			if (nums[i] != nums[j])
			{
				nums[++i] = nums[j];
				firstDuplicate = false;
			}
			else
			{
				if (!firstDuplicate)
				{
					firstDuplicate = true;
					nums[++i] = nums[j];
				}
			}
		}
		return i + 1;
	}
};