leetcode question 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 by modifying the input array in-place with O(1) extra memory.

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

Example:

Given nums = [3,2,2,3], val = 3,

Your function should return length = 2, with the first two elements of nums being 2.

这道题叫我们删除数组中指定的数字，并将后面的数字顺序往前推，最后返回最后数组的长度。这道题的思路和问题26很相似，直接上代码。

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