27.Remove Element

最新推荐文章于 2024-02-22 13:25:37 发布

鸡蛋灌饼想加辣条

最新推荐文章于 2024-02-22 13:25:37 发布

阅读量89

点赞数

CC 4.0 BY-SA版权

分类专栏：每日Leetcode 文章标签：编程基础

本文链接：https://blog.youkuaiyun.com/gyhjlauy/article/details/88861627

每日Leetcode 专栏收录该内容

124 篇文章

订阅专栏

本文介绍了一个C++实现的算法，该算法能够在不使用额外空间的情况下，从数组中移除所有指定值的实例，并返回新的长度。示例展示了如何将一个包含特定值的数组缩减为不含该值的新数组，同时保持原有数组的空间不变。

题目：
Given an array nums and a value val, 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 by modifying the input array in-place with O(1) extra memory.

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

Example 1:

Given nums = [3,2,2,3], val = 3,

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

It doesn’t matter what you leave beyond the returned length.

Example 2:

Given nums = [0,1,2,2,3,0,4,2], val = 2,

Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.

Note that the order of those five elements can be arbitrary.

It doesn’t matter what values are set beyond the returned length.
解析：给定一个数组，删除数组中指定元素。

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