#26 Remove Duplicates from Sorted Array

原创于 2015-07-19 17:04:28 发布 · 597 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #C #Array #Two Pointers

LeetCode 专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下移除有序数组中重复元素的方法，并提供了具体的C语言实现。该方法通过一次遍历实现了原地修改数组以去除重复元素的目标。

题目链接：https://leetcode.com/problems/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 <= 1)                   //如果少于一个元素，没有重复元
        return numsSize;
    int index = 0;                      //标记删除重复元后的最后一个元素下标
    for(int i = 1; i < numsSize; ++i)   //遍历数组，如果当前元素与前一个不相同，加入到已处理数组中
        if(nums[i] != nums[index])
            nums[++index] = nums[i];    //删除后的数组永远小于原来数组，所以可以直接在原数组上储存
    return index + 1;
}