刪除排序數(shù)組中的重復(fù)數(shù)字

利用庫函數(shù)，偷懶法

class Solution {
public:
    /**
     * @param A: a list of integers
     * @return : return an integer
     */
    int removeDuplicates(vector<int> &nums) {
        // write your code here
        
        nums.erase(unique(nums.begin(), nums.end()), nums.end());
        
        return nums.size();
    }
};

class Solution {
public:
    /**
     * @param A: a list of integers
     * @return : return an integer
     */
    int removeDuplicates(vector<int> &nums) {
        // write your code here
        
        int len = nums.size();
        
        if(len == 0) {
            return 0;
        }
        
        int size = 1;
        
        for(int i = 1; i < len; ++i) {
            if(nums[i] == nums[i-1]) {
                continue;
            }
            
            nums[size++] = nums[i];
        }
        
        return size;
        
        
    }
};