Leetcode 26题 删除有序数组中的重复项

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

        int res = 1;
        int i=0, j;
        for (j=1; j<len; ++j) {
    
    
            if (nums[j] != nums[i])  {
    
    
                swap(nums[++i], nums[j]);
                ++res;
            }
        }

        return res;
    }
};