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.
中心思想:
中心思想:新建一个vector存数字,由于是数字一遍就把之前的数字推上去,loop结束后一定要加上最后一个数字
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
vector<int> tmp;
int n = nums.size();
if (n == 0)
return 0;
int candidate = nums[0];
for (int i = 0; i < n; i++){
if (nums[i] != candidate){
tmp.push_back(candidate);
candidate = nums[i];
}
}
tmp.push_back(nums[n-1]);
nums = tmp;
return tmp.size();
}
};