26. Remove Duplicates from Sorted Array

最新推荐文章于 2024-01-02 23:35:28 发布

原创最新推荐文章于 2024-01-02 23:35:28 发布 · 255 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个C++解决方案，用于在不使用额外空间的情况下删除已排序数组中的重复元素，并返回新长度。通过遍历数组并比较相邻元素来实现，只保留唯一的元素。

题目
想法
Code

题目

Given a sorted array nums, 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 by modifying the input array in-place with O(1) extra memory.
Example 1:

Given 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 returned length.

Example 2:

Given nums = [0,0,1,1,1,2,2,3,3,4], Your function should return length
= 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively. It doesn't matter what values are set beyond the returned length.

想法

原理同27. Remove Element

Code


class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        if (nums.size()<= 0 )
            return 0;
        int i = 0 ;
        for (int j = 1 ; j < nums.size(); j++){
            if(nums.at(i)!=nums.at(j)){
                i++;
                nums.at(i) = nums.at(j);
            }
        }
        return i + 1 ;
    }
};