[Leetcode] 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.

思路：

        思路和Leetcode 26十分类似：如果当前值不等于需要移除的元素值，则将其复制到当前结果中，并让长度增加；否则直接跳过。

代码：

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int new_length = 0;
    	for (size_t i = 0; i < nums.size(); i++)
    	{
    		if (nums[i] != val)
    			nums[new_length++] = nums[i];
    	}
    	return new_length;
    }
};