LeetCode (Remove Element)

最新推荐文章于 2024-02-23 09:08:20 发布

胡为乎遑遑于何之

最新推荐文章于 2024-02-23 09:08:20 发布

阅读量264

点赞数

CC 4.0 BY-SA版权

分类专栏： C++

本文链接：https://blog.youkuaiyun.com/m0_37705274/article/details/70597987

C++ 专栏收录该内容

83 篇文章

订阅专栏

本文介绍了一种使用C++标准模板库(STL)中的vector容器来实现原地移除数组中特定值的方法。该方法通过迭代器遍历数组，并利用erase成员函数移除指定值，最终返回新的有效数组长度。

Problem:

Given an array and a value, remove all instances of that value in place and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

The order of elements can be changed. It doesn't matter what you leave beyond the new length.

Example:
Given input array nums = [3,2,2,3], val = 3

Your function should return length = 2, with the first two elements of nums being 2.

Solution:

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        if (nums.empty()) return 0;
        vector<int>::iterator it = nums.begin();
        while (it != nums.end()){
            if (*it == val) 
                nums.erase(it);
            else
                it++;
        }
        return nums.size();
    }
};