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.
题解
已排序的数组中,删掉数组里重复的元素,返回最后剩余元素个数m。同时,数组前m个元素就是不重复的那m个元素。
所以做法是第一要计数,第二要变位。
//cpp
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size()==0)
return 0;
int index=0;
for(int i=1;i!=nums.size();i++)
{
if(nums[i]!=nums[index])
nums[++index]=nums[i];
}
return index+1;
}
};