26. Remove Duplicates from Sorted Array

原创于 2016-04-19 08:54:48 发布 · 269 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #LeetCode

LeetCode 专栏收录该内容

32 篇文章

订阅专栏

本文介绍了一个算法，用于在不使用额外空间的情况下，去除已排序数组中的重复元素，并返回数组的新长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 < 2)
			return nums.length;
		//输入进行判断	
		int swapped = 1;
		for(int i=1; i<nums.length; i++)
			if(nums[i-1]<nums[i]) {
				nums[swapped] = nums[i];
				swapped++;
			}
		//思路是如果存在增序，则添加到数组里来
		return swapped;	
	}
}

水水的~