26. Remove Duplicates from Sorted Array

最新推荐文章于 2025-07-25 16:34:02 发布

zb_possible

最新推荐文章于 2025-07-25 16:34:02 发布

阅读量244

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode Remove Duplicates fr

本文链接：https://blog.youkuaiyun.com/zb_possible/article/details/51660937

leetcode 专栏收录该内容

18 篇文章

订阅专栏

本文介绍了一个高效的算法，用于在不使用额外空间的情况下移除已排序数组中的重复元素，并返回新数组的有效长度。通过一个简单的Java实现示例，展示了如何保持内存消耗不变的同时更新数组内容。

摘要生成于 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  int removeDuplicates(int[] nums) {
		int num = 0;
		if(nums == null || nums.length == 0){
			return num;
		}
		
		num =1;
		int pre = nums[0];
		for(int i=1,len=nums.length; i<len; i++){
			if(nums[i] != pre){
				pre = nums[i];
				nums[num++] = nums[i];
			}
		}
		
		return num;
	}