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.
解题方法:
1.将数组进行遍历,从第一个开始,如果不相等,则赋值,相等则++,不赋值。时间复杂度为O(N),空间复杂度O(1).
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[index]!=nums[i])
{
nums[++index]=nums[i];
}
}
return index+1;
}
};