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.

意思：将数组中和val值相等的元素删除，返回数组长度

思路和283差不多，遍历数组，相等就删除，不相等++

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
    	for (auto ite = nums.begin(); ite != nums.end();)
    	{
        	if (*ite == val)
    		{
    			ite = nums.erase(ite);
    		}
    		else{
    			ite++;
    		}
    	}
    	return nums.size();
    }
};

测试的结果很不满意

优化：

其实没必要将元素冲原数组中删去，通过观看其他人的代码发现，将新的数组的长度返回，测试样例会自动截取。可以不必太依赖于迭代器。

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
    	int k=0;
    	for (int i = 0; i <nums.size();i++)
    	{
        	if(nums[i]!=val)
        	   nums[k++]=nums[i];  //swap(nums[k],nums[i])效率一样
    	}
    	return k;
    }
};