题目:
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
For example,
Given input array nums = [1,1,2]
,
Your function should return length = 2
, with the first two elements of nums being 1
and 2
respectively. It doesn't matter what you leave beyond the new length.
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size() <= 1) return nums.size();
int newEnd = 1;//指向新数组最后一个元素的下一个元素
int i = 1;//用于遍历数组
for(; i < nums.size(); ++i){//无论哪种情况都要更新i,所以用for循环比while循环更合适
if(nums[i] == nums[i-1]) continue;
nums[newEnd] = nums[i];
++newEnd;
}
return newEnd;
}
};