[LeetCode] 26. 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:
Given nums = [1,1,2], Your function should return length = [code]2, with the first two elements of
numsbeing
1and
2respectively. It doesn't matter what you leave beyond the returned length.[/code]
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4], Your function should return length = [code]5, with the first five elements of
numsbeing modified to
0,
1,
2,
3, and
4respectively. It doesn't matter what values are set beyond the returned length. [/code]
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]); }
去除有序数组中的重复项,返回新数组的长度,要求in-place,O(1)的额外空间。
解法:双指针Two Pointers,一个指针遍历数组所有元素,一个指针指向遍历后的不重复元素的边界。
Java:
class Solution { public static int removeDuplicatesNaive(int[] A) { if (A.length < 2) return A.length; int j = 0; int i = 1; while (i < A.length) { if (A[i] == A[j]) { i++; } else { j++; A[j] = A[i]; i++; } } return j + 1; } }
Python:
class Solution: # @param a list of integers # @return an integer def removeDuplicates(self, A): if not A: return 0 last, i = 0, 1 while i < len(A): if A[last] != A[i]: last += 1 A[last] = A[i] i += 1 return last + 1
C++:
class Solution { public: int removeDuplicates(vector<int>& nums) { if (nums.empty()) return 0; int pre = 0, cur = 0, n = nums.size(); while (cur < n) { if (nums[pre] == nums[cur]) ++cur; else nums[++pre] = nums[cur++]; } return pre + 1; } };
C++:
class Solution { public: int removeDuplicates(int A[], int n) { if(n < 2) return n; int id = 1; for(int i = 1; i < n; ++i) if(A[i] != A[i-1]) A[id++] = A[i]; return id; } };
类似题目:
[LeetCode] 27. Remove Element 移除元素
[LeetCode] 283. Move Zeroes 移动零
[LeetCode] 80. Remove Duplicates from Sorted Array II 有序数组中去除重复项 II
All LeetCode Questions List 题目汇总
- LeetCode 26. Remove Duplicates from Sorted Array(移除有序数组的重复元素)
- [LeetCode] Remove Duplicates from Sorted Array 有序数组中去除重复项
- LeetCode 26 Remove Duplicates from Sorted Array (移除有序数组中重复数字)
- Remove Duplicates from Sorted Array II 从有序数组里移除重复出现元素,最多重复出现2次 @LeetCode
- leetCode26 Remove Duplicates from Sorted Array(移除多余的重复数组元素)
- Remove Duplicates from Sorted Array 有序数组中去除重复项
- [LeetCode-26] Remove Duplicates from Sorted Array(移除数组重复元素)
- LeetCode-26:Remove Duplicates from Sorted Array (清除数组重复元素)
- LeetCode-26-Remove Duplicates from Sorted Array(消除已排序数组中的重复元素)
- leetcode 4. 移除有序数组中的重复元素 Remove Duplicates from Sorted Array
- LeetCode 26 Remove Duplicates from Sorted Array(从已排序数组中移除重复元素)
- Leetcode26:Remove Duplicates from Sorted Array(移除已排序数组中重复的数字)
- [C++]LeetCode 26: Remove Duplicates from Sorted Array(有序数组去重)
- [LeetCode] Remove Duplicates from Sorted Array II 有序数组中去除重复项之二
- leetcode 26. Remove Duplicates from Sorted Array从排序数组中移出重复元素(双指针)
- LeetCode 26 Remove Duplicates from Sorted Array(从已排序数组中移除重复元素)
- LeetCode | Remove Duplicates from Sorted Array(删除有序数组的重复元素)
- 27.[LeetCode] Remove Duplicates from Sorted Array 有序数组中去除重复项
- leetCode 26.Remove Duplicates from Sorted Array(删除数组重复点) 解题思路和方法
- LeetCode-Remove Duplicates from Sorted Array-从有序数组移除重复-简单逻辑