从零开始的LC刷题(8): Remove Duplicates from Sorted Array

原题：

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.

Example 1:Given 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 returned length.

Example 2:Given nums = [0,0,1,1,1,2,2,3,3,4], Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively. It doesn't matter what values are set beyond the returned length.

就是去掉有序数列中的重复元素，其实这道题自己想到的算法很简单很蠢，看了solution感觉这个去除重复元素的方式效率很高(O(n))，原理是两个指针ab，a在前碰到与b不同的就b++并且令nums[b]=nums[a]，如果相同则a++直到遇到不同的，用c++写了下结果如下：

Success

Runtime: 24 ms, faster than 98.72% of C++ online submissions for Remove Duplicates from Sorted Array.

Memory Usage: 9.8 MB, less than 100.00% of C++ online submissions for Remove Duplicates from Sorted Array.

代码：

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