【LeetCode算法練習（C++）】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.

鏈接：Remove Element
解法：遍歷數組，刪除目標值，返回刪除後的數組大小。時間O(n)

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        vector<int>::iterator i = nums.begin();
        for (; i != nums.end();) {
            if (*i == val) {
                i = nums.erase(i);
            } else {
                i++;
            }
        }
        return nums.size();
    }
};

Runtime: 6 ms