Remove Duplicates from Sorted Array

最新推荐文章于 2022-04-06 16:22:53 发布

原创最新推荐文章于 2022-04-06 16:22:53 发布 · 575 阅读

0 ·

CC 4.0 BY-SA版权

数据结构&算法专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下从有序数组中去除重复元素的方法，通过双指针技术实现，确保每个元素只出现一次，并返回新的长度。

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

Remove Duplicates from Sorted Array

My Submissions

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.

分析：

两个指针：

1 2 2 3 3 3 4 5 5 5 5

| |

3 3

| |

 public int removeDuplicates1(int[] nums) {
        if (nums == null || nums.length < 1) return 0;
        int curPos = 0, endPos = 1, i;
        while ( endPos < nums.length) {
            if (nums[curPos] != nums[endPos]) {
                // for (i = curPos + 1; i < endPos && i + endPos - curPos - 1 < nums.length; i++) {
                nums[++curPos] = nums[endPos++];
                // }
                //curPos++;

            } else {
                endPos++;
            }
        }
        return curPos + 1;
    }