leetcode-27. Remove Element

LeetCode 27题解析

最新推荐文章于 2025-04-25 23:43:23 发布

myan991

最新推荐文章于 2025-04-25 23:43:23 发布

阅读量192

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/myan991/article/details/60784407

leetcode 专栏收录该内容

24 篇文章

订阅专栏

本文详细介绍了LeetCode上的第27题“Remove Element”的解题思路与代码实现，探讨了如何在不使用额外空间的情况下高效移除数组中指定元素的方法，并提供了两种不同的C++代码实现。

leetcode-27. Remove Element

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.

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int res = 0;
        for(int i = 0; i < nums.size(); ++i){
            if(nums[i]!=val){
                nums[res] = nums[i];
                res++;
            }
        }
        return res;
    }
};

有一个地方可以改进，res++这里

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int res = 0;
        for(int i = 0; i < nums.size(); ++i){
            if(nums[i]!=val)
                nums[res++] = nums[i];
        }
        return res;
    }
};