LeetCode 26: Remove Duplicates from Sorted Array

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #数组去重

leetcode 专栏收录该内容

91 篇文章

订阅专栏

本文介绍了一种在不使用额外空间的情况下从已排序数组中移除重复元素的方法，并确保每个元素只出现一次。通过一个简单的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 2respectively. It doesn’t matter what you leave beyond the new length.

解题思路

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if (nums.size() < 1) return 0;

        int index = 1;
        int size = nums.size();
        for (int i = 1; i < size; ++i) {
            if (nums[i] != nums[i-1]) {
                nums[index++] = nums[i];
            }
        }
        return index;
    }
};