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

https://leetcode.cn/leetbook/read/top-interview-questions-easy/x2gy9m/

https://leetcode.cn/problems/remove-duplicates-from-sorted-array/description/

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

• 时间复杂度：O(n)
• 空间复杂度：O(1)