[Leetcode] 27 Remove Element

标签：cat   new   ase   com   begin   tor   this   etc   inpu   

原题地址：

https://leetcode.com/problems/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 length = nums.size();
        for (vector<int>::iterator it = nums.begin(); it != nums.end();) {
            if (*it == val) {
            　　it = nums.erase(it);
            　　length--;
        　　 }
        　　 else {
        　　　　it++;
        　　 }
        }
    　　return length;
    }
}

[Leetcode] 27 Remove Element

标签：cat   new   ase   com   begin   tor   this   etc   inpu   

原文地址：http://www.cnblogs.com/fengziwei/p/7502032.html