LeetCode Exercise 2: Remove Duplicates from Sorted Array

最新推荐文章于 2024-10-20 21:47:19 发布

邓小菜

最新推荐文章于 2024-10-20 21:47:19 发布

阅读量164

点赞数

分类专栏： LeetCode Exercise 文章标签： C++ leetcode 算法

本文链接：https://blog.csdn.net/qq_33361432/article/details/78081021

版权

LeetCode Exercise 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

题名：Remove Duplicates from Sorted Array

难度：Easy

题目描述：

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.直接利用迭代器使用vector的删除函数erase即可达到题目要求；

3.注意迭代器的begin是vector的第一个元素，而end则不是，在循环中判断两个元素是否重复时要先判断是否已经到达迭代器的end，以免造成Run Time Error。

代码如下：

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int n = 0;
        if(nums.size() == 0){
            return 0;
        }
        else{
            n = 1;
        }
        for(auto it = nums.begin(); it != nums.end(); it++){
            auto it2 = it + 1;
            if(it2 == nums.end()){
                return n;
            }
            if(*it != *it2){
                n++;
            }
            else{
                nums.erase(it2);
                it--;
            }
        }
        return n;
    }
};