Leetcode-27 Remove Element

Posted 北冥有鱼,南冥有猫

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Leetcode-27 Remove Element相关的知识,希望对你有一定的参考价值。

#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.

Hint:

1. Try two pointers.

题解:根据提示来做就好了。

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)
            {
                swap(nums[i],nums[cnt]);
                cnt++;
            }
        }
        return cnt;
    }
};

 


以上是关于Leetcode-27 Remove Element的主要内容,如果未能解决你的问题,请参考以下文章

[Leetcode] 27 Remove Element

#Leetcode# 27. Remove Element

[LeetCode]27. Remove Element

LeetCode 27 Remove Element

Leetcode-27 Remove Element

LeetCode27. Remove Element