Leetcode_26: removeDuplicates

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