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;
    }
};

還有很多其他的方法，這裏就不列出了，感覺都是數字規律問題