java数组去重

最新推荐文章于 2023-08-09 19:41:39 发布

diu_brother

最新推荐文章于 2023-08-09 19:41:39 发布

阅读量479

点赞数

分类专栏： leetcode 文章标签： java 数组算法 leetcode

本文链接：https://blog.youkuaiyun.com/diu_brother/article/details/51869066

版权

leetcode 专栏收录该内容

42 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下从已排序数组中去除重复元素的方法。通过双指针技巧，确保每个元素只出现一次，并返回新长度。示例中输入数组为[1,1,2]，处理后应保留两个元素，即1和2。

摘要生成于 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==null)
            return 0;
        if(nums.length==1)
            return 1;
        int current = 0;
        int next = 1;
        int len = nums.length;
        while(next<len){
            if(nums[next]==nums[current]){
                for(int j=next;j<len-1;j++){
                    nums[j] = nums[j+1];
                }
                len--;
            }
            if(nums[next]!=nums[current]){
                next++;
                current++;
            }

        }
        return len;
    }
}