LeetCode 0026 - Remove Duplicates from Sorted Array
# Hints
- 水题
# 题面
Difficulty | Time Complexity Limit | Extra-Memory Complexity Limit |
---|---|---|
Easy |
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 by modifying the input array in-place with 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.
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:
// 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]);
}
# 题意
给定一个有序数组 ,要求将其中的重复元素全部去除,通过引用修改 中的内容,并返回新的 的长度。
# 题解
水题,按题意模拟即可。
# AC代码
class Solution {
public:
int removeDuplicates(vector<int> & nums) {
// 特判
if (nums.empty()) {
return 0;
}
// 求解
int n = 1;
for (int i = 1; i < nums.size(); i ++) {
if (nums[i] != nums[n - 1]) {
nums[n++] = nums[i];
}
}
// 返回
return n;
}
};
- 01
- Reading Papers - Kernel Concurrency06-01
- 02
- Linux Kernel - Source Code Overview05-01
- 03
- Linux Kernel - Per-CPU Storage05-01