Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn‘t matter what you leave beyond the new length.
题解：水题。遇到val就和最后一个不是val的数交换位置就好了。
class Solution { public: int removeElement(vector<int>& nums, int val) { int len=nums.size(); int e=len-1; for(int i=0;i<len;i++){ if(nums[i]==val){ while(nums[e]==val&&e>i){ e--; } if(e==i){ return i; } else{ swap(nums[e],nums[i]); } } } return len; } };
原文：http://www.cnblogs.com/zywscq/p/5222056.html