27. Remove Element

题目：Remove Element

原题链接：https://leetcode.com/problems/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.

删除数组中制定的元素，返回新的长度，要求不允许创建新的数组，使用常数级的内存。

例：给出数组 [3,2,2,3], val = 3
返回的长度为2，数组中剩下的元素为[2,2]。

和第26题一样，用一个now和一个cnt，now表示当前扫描到的数组元素的下标，0到cnt - 1表示0到now -1已经整理好的部分。如果nums[now] == val，则继续往下扫描，否则nums[cnt++] = nums[now++]。

代码如下：

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int len = nums.size();
        int now = 0, cnt = 0;
        while(now < len) {
            if(nums[now] != val) {
                nums[cnt++] = nums[now++];
            }else{
                now++;
            }
        }
        nums.erase(nums.begin() + cnt, nums.end());
        return cnt;
    }
};