26. 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.
前俩个元素必须是1，2，数组的长度我们不CARE

感觉283. Move Zeroes中大神的模板超级好用

class Solution {
public:
    int removeDuplicates(vector<int>& v) {

    if(v.size()==0)
        return 0;

       int j=0;
       for(int i=0; i<v.size(); i++)
       {
           if(v[i] != v[j])
           {
               v[++j]=v[i];
           }
       }
       return j+1;
    }
};

还有很多其他的方法，这里就不列出了，感觉都是数字规律问题