Remove Duplicates from Sorted Array
问题描述:
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.
知识补充:
auto 关键字 可以自动推断变量的类型
int a = 10;
auto au_a = a;//自动类型推断,au_a为int类型
cout << typeid(au_a).name() << endl;//typeid运算符可以输出变量的类型。
unique函数
//unique函数作用是“删除”输入序列中所有相邻的重复元素。并且返回一个迭代器(容器的长度没变,只是元素顺序改变了)。其实它并不真正把重复的元素删除,是把重复的元素移到后面去了,然后依然保存到了原数组中,然后 返回去重后最后一个元素的地址,因为unique去除的是相邻的重复元素,所以一般用之前都会要排一下序。
测试代码:
int i = 1;
while(i<nums.size())
{
if(nums[i]==nums[i-1])
{
nums.erase(nums.begin()+i);
continue;
}
i++;
}
return nums.size();
性能:
参考答案1:
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size() == 0) return 0;
auto iter = unique(nums.begin(), nums.end());
nums.erase(iter, nums.end());
return nums.size();
}
};
性能:
参考答案2:
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
int len = nums.size(), left = 0, right = 0;
while(right < len){
while(nums[left] == nums[right++]);
nums[++left] = nums[--right];
}
return left;
}
};