Leet Code OJ 26. Remove Duplicates from Sorted Array [Difficulty: 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 in place with constant memory.

For example,
Given input array 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 new length.

翻译：
给定一个排序好的数组，就地移除重复的元素，来使得每个元素只出现一次，并且返回新的长度。
不要分配额外的空间给另一个数组，你必须完成它在原数组上，并且只使用常数级的内存。

分析：
由于需要移除重复的元素，所以必须有移动元素的操作。当遍历的i指针指向的元素与上一个元素重复时，需要采用一个指针nextEmpty来记录当前这个位置（需要被移除的位置，也就是要把后面的元素复制过来的位置），当遍历到下一个不重复的元素时，再复制到这个位置。

代码：

public class Solution {public int removeDuplicates(int[] nums) {int nextEmpty=1;for(int i=1;i<nums.length;i++){if(nums[i]!=nums[i-1]){nums[nextEmpty]=nums[i];nextEmpty++;}}return nextEmpty;}
}

Leet Code OJ 26. Remove Duplicates from Sorted Array [Difficulty: Easy]相关推荐

Leet Code OJ 83. Remove Duplicates from Sorted List [Difficulty: Easy]
题目: Given a sorted linked list, delete all duplicates such that each element appear only once. For e ...
26. Remove Duplicates from Sorted Array【easy】
26. Remove Duplicates from Sorted Array[easy] Given a sorted array, remove the duplicates in place s ...
LeetCode 26 Remove Duplicates from Sorted Array [Array/std::distance/std::unique] c++
LeetCode 26 Remove Duplicates from Sorted Array [Array/std::distance/std::unique] <c++> 给出排序好的 ...
LeetCode 26. Remove Duplicates from Sorted Array
题目: Given a sorted array, remove the duplicates in place such that each element appear only once and ...
leetcode python3 简单题26. Remove Duplicates from Sorted Array
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第二十六题 (1)题目英文: Given a sorted array nums, ...
Leet Code OJ 4. Median of Two Sorted Arrays [Difficulty: Hard]
题目 There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the ...
leetCode #26 Remove Duplicates from Sorted Array
删除相同数字 1 class Solution { 2 public: 3 int removeDuplicates(vector<int>& nums) { 4 int coun ...
Leet Code OJ 102. Binary Tree Level Order Traversal [Difficulty: Easy]
题目: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to ri ...
Leet Code OJ 104. Maximum Depth of Binary Tree [Difficulty: Easy]
题目: Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the ...

Leet Code OJ 26. Remove Duplicates from Sorted Array [Difficulty: Easy]

Leet Code OJ 26. Remove Duplicates from Sorted Array [Difficulty: Easy]相关推荐

最新文章

热门文章