LeetCode : Remove Duplicates from Sorted Array [java]

最新推荐文章于 2024-01-02 23:35:28 发布

原创最新推荐文章于 2024-01-02 23:35:28 发布 · 275 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Remove Duplicates fr

Java 同时被 2 个专栏收录

64 篇文章

订阅专栏

编程练习题

45 篇文章

订阅专栏

本文介绍了一个高效的算法，用于在不使用额外空间的情况下移除已排序数组中的重复元素，并返回唯一元素的数量。通过遍历数组并将不同元素向前移动，确保数组前部分只包含唯一值。

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.

思路：遍历数组，遇到不同的就往前放，直到遍历完，前边放好的就是具备唯一性的数组了。

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