Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns 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.
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 a modification to the input array will be known to the caller as well.
Internally you can think of this:
// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);
// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
print(nums[i]);
}
Example 1:
1 | Input: nums = [1,1,2] |
Example 2:
1 | Input: nums = [0,0,1,1,1,2,2,3,3,4] |
Constraints:
1 | 0 <= nums.length <= 3 * 104 |
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
那我們就不能直接len(list(set(nums))),但題目提到已經排序好了,那我們可以尋訪他,當數字變動就加1。
如果你覺得這篇文章很棒,請你不吝點讚 (゚∀゚)