题目:
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.
题意:
给定一个已经排好序的数组,删除数组中重复的元素,返回删除之后的数组长度。
解题思路:
与remove element 和 moveZeroes题目相似,比较前后元素是否相同。注意边界条件
代码:
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.empty())
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;
}
};