mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 16:36:41 +08:00
57 lines
2.0 KiB
Markdown
57 lines
2.0 KiB
Markdown
# [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) extra memory.
|
||
|
||
Example 1:
|
||
|
||
```c
|
||
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:
|
||
|
||
```c
|
||
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:
|
||
|
||
```c
|
||
// nums is passed in by reference. (i.e., without making a copy)
|
||
int len = removeElement(nums, val);
|
||
|
||
// 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]);
|
||
}
|
||
```
|
||
|
||
## 题目大意
|
||
|
||
给定一个有序数组 nums，对数组中的元素进行去重，使得原数组中的每个元素只有一个。最后返回去重以后数组的长度值。
|
||
|
||
## 解题思路
|
||
|
||
这道题和第 27 题很像。这道题和第 283 题，第 27 题基本一致，283 题是删除 0，27 题是删除指定元素，这一题是删除重复元素，实质是一样的。
|
||
|
||
这里数组的删除并不是真的删除，只是将删除的元素移动到数组后面的空间内，然后返回数组实际剩余的元素个数，OJ 最终判断题目的时候会读取数组剩余个数的元素进行输出。
|