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

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

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if(nums.empty())
            return 0;
        int point = 1, length = nums.size();
        for(int i = 1; i < length; ++i)
        {
            if(nums[i] == nums[i - 1])
                continue;
            nums[point++] = nums[i];
        }
        return point;
    }
};