问题描述:
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.
示例:
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.使用两个指针,一个用来遍历原有的数组,另一个用来存储消除重复数字的数组。
2.第二个指针正好也可以作为新的数组长度输出
详细过程请看代码:
int removeDuplicates(vector<int>& nums) {
int i = !nums.empty();
for (int n : nums)
if (n > nums[i-1])
nums[i++] = n;
return i;
}