LeetCode-26 删除排序數組中的重複項

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
		int left = 0;//[0,left]之間是已剔除重複元素的序列
		int right = 1;//用于找下一個不重複的元素
		int res = nums.size();
		while(right < nums.size())
		{
			while(right < nums.size() && nums[left] == nums[right])
			{
				right++;
				res--;
			}
			if(right == nums.size())
				return res;
			nums[left + 1] = nums[right];
			left++;
			right++;
		}
		
		return res;
    }
};