问题描述:
Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.
Example 1:
Given nums = [1,1,2], Your function should return length =2
, with the first two elements ofnums
being1
and2
respectively. It doesn't matter what you leave beyond the returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4], Your function should return length =5
, with the first five elements ofnums
being modified to0
,1
,2
,3
, and4
respectively. It doesn't matter what values are set beyond the returned length
问题解决:
用两个循环依次比较,代码如下:
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int l = nums.size(),i=1,j=1;
if(l<2){
return l;
}
while(i<l){
if(nums[i]!=nums[i-1]){
nums[j] = nums[i];
j++;
}
i++;
}
return j;
}
};