26. Remove Duplicates from Sorted Array*
https://leetcode.com/problems/remove-duplicates-from-sorted-array/
题目描述
Given a sorted array nums
, 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 by modifying the input array in-place with O ( 1 ) O(1) O(1) extra memory.
Example 1:
Given 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 returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],
Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
It doesn't matter what values are set beyond the returned length.
解题思路
使用双指针, 指针 k
指向 unique array (不包含重复元素的数组) 的最后一个位置, i
指针来遍历数组.
如果当前 nums[i]
与 nums[k]
不相等, 说明 nums[i]
可以加入到 unique array 中, 最后通过 k
来计算 unique array 的长度.
C++ 实现 1
时间复杂度为 O ( 1 ) O(1) O(1).
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.empty()) return 0;
int k = 0;
for (int i = 1; i < nums.size(); ++i) {
if (nums[i] != nums[k])
nums[++k] = nums[i];
}
return k + 1;
}
};