leetcode 之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.

题目很简单：

移除数组中给定的元素，返回数组长度；

细节在于++iter应当放在if ...else..判断中，避免erase后迭代器多次偏移

class Solution {

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