26. Remove Duplicates from Sorted Array(删除已排序数组中的重复数)-two pointers

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.

“去除”一个已经排序好的数组中重复的数。如果直接去除，那么会牵扯到数据的移动，时间复杂度将大于O(n),最坏情况下会是O(n^2)。

题目中说了It doesn't matter what you leave beyond the new length。所以可以考虑将后面的数（重复的数只取其中的一个）赋给前面不符合递增条件的数。

1) 若nums[i]>nums[i-1]，表明nums[i]及其前面的数符合递增的条件，直接i++

2) 若nums[i]<=nums[i-1]&&nums[j]!=nums[j-1],表明nums[i]不符合递增的条件，且nums[j]是一个与前一个数不等的数。nums[i] = nums[j]; i++;

3）j++;

时间复杂度O(n),空间复杂度O(1)。具体见代码：

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