【Leetcode】算法题26 Remove Duplicates from Sorted Array

最新推荐文章于 2026-06-23 22:46:37 发布

原创最新推荐文章于 2026-06-23 22:46:37 发布 · 241 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#C语言 #源码 #leetcode #算法

收录于

leetcode 专栏收录该内容

6 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下从有序数组中去除重复元素的方法，并提供了一个C语言实现的例子。该方法通过遍历数组并只保留不重复的元素来达到目的，最终返回新的有效长度。

题目：

原题链接：Remove Duplicates from Sorted Array

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.

贴代码：

int removeDuplicates(int* nums, int numsSize) {
    if (numsSize == 0)
        return 0;
    int i = 0;
    int rest = 0;
    int first = nums[0];
    for (i = 0; i < numsSize; i++) {
        if (nums[i] != first){
            rest++;
            first = nums[i];
            nums[rest] = nums[i];
        }
    }
    return rest + 1;
}

时间排名：