美文网首页
27. Remove Element FROM Leetcode

27. Remove Element FROM Leetcode

作者: 时光杂货店 | 来源:发表于2017-03-17 15:20 被阅读3次

    题目

    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.

    频度: 4

    解题之法

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

    相关文章

      网友评论

          本文标题:27. Remove Element FROM Leetcode

          本文链接:https://www.haomeiwen.com/subject/ujmenttx.html