算法第六周Remove Element[easy]

Remove Element[easy]

---

Description

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.

---

Solution

这道题很容易，就是删除数组中与给定val值相等的元素，最后返回数组的长度。

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