清除元素

LEECODE Algorithm 27. Remove Element

• 题目
• 代码块
• 想法

---

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.

代码

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

想法

题目主要考差了c++中容器的删除操作，使用迭代器的时候，由于iterator erase( iterator _Where)，返回的是已删除元素的下一个元素，所以不必迭代器自增，除非是不删除该元素，那么手动iter++，便可实现容器中元素的删除.