Description

Submission

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