removeDuplicates

给定一个有序数组，你需要原地删除其中的重复内容，使每个元素只出现一次,并返回新的长度。

不要另外定义一个数组，您必须通过用 O(1) 额外内存原地修改输入的数组来做到这一点。

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

class Solution {
public:
    int removeDuplicates(vector& nums) {
        int m = nums.size();
        if(m<=1) return m;
        for(vector::iterator it1 = nums.begin();it1 != nums.end(); it1++)
        {
            for(vector::iterator it2 = it1+1; it2 != nums.end(); )
                {
                    if(*it1 == *it2)  it2 = nums.erase(it2);
                    else it2++;
                }
        }
        return nums.size();
    }
};