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.

Solutions:

用两个位置指针，一个用来遍历i，一个用来指示已经遍历过的中有多少不重复的，cnt。当当前的数和前一个不一样时，就和位置为cnt+1的数互换。

这样就能保证前cnt个都是不重复的。

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.size() < 2) 
			return nums.size();
		int prev=nums[0];
		int cnt=1;
//		bool flag=false;
		for(int i=1; i<nums.size(); ++i) {
			if(nums[i] != prev) {
				prev=nums[i];
//				if(flag==false)	{				
				    swap(nums[cnt], nums[i]);
//				    flag=true;
//				}
				++cnt;
			}
//			else {
//			    flag=false;
//			}
		}
		return cnt;
    }
};