LeetCode 27.Remove Element 数组元素删除

标签：数组

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 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) {
        for(int i = 0; i < nums.size(); i++)
        {
            if(nums[i] == val )
            {
                nums.erase (nums.begin() + i );
                i--;
            }
        }
        return nums.size();
    }
};

2016-08-05 20:42:00

本文出自 “做最好的自己” 博客，请务必保留此出处http://qiaopeng688.blog.51cto.com/3572484/1834869

LeetCode 27.Remove Element 数组元素删除

标签：数组

原文地址：http://qiaopeng688.blog.51cto.com/3572484/1834869