Remove Element

最新推荐文章于 2021-02-04 13:49:30 发布

原创最新推荐文章于 2021-02-04 13:49:30 发布 · 354 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Remove Element

leetcode 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种在数组中移除指定值并返回新长度的算法实现。通过双指针技术，该方法能在原地修改数组，忽略被移除元素后的部分。适用于需要高效处理数组元素场景。

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

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

此题与Remove Duplicates from Sorted Array类似的做法

class Solution {
public:
    //与Remove Duplicates from Sorted Array类似的做法
    int removeElement(vector<int>& nums, int val) {
        int len = nums.size();
        if(len < 1)
            return 0;
        if(len == 1)
        {
            if(nums[0] == val)
                return 0;
            return 1;
        }
        int low = 0, high = 0;
        while(high < len)
        {
            if(nums[high] != val)
            {
                nums[low++] = nums[high];
            }
            ++high;
        }
        
        return low;
    }
};