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) extra memory.
Example 1:
1 |
Given nums = [1,1,2], |
Example 2:
1 |
Given nums = [0,0,1,1,1,2,2,3,3,4], |
Clarification:
Confused why the returned value is an integer but your answer is an array?
Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.
Internally you can think of this:
1 |
|
my code in cpp
1 |
int (vector<int>& nums) { |
总结
- 双指针,一个指向老数组,一个指向新数组。如果老数组指针的值不等于新数组指针的值,新数组向前移一格。就是把[27] 移除元素的target变成nums[_new]了。
- 另外记得做入口检查。
近期评论