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.
此题和第26题一样，也是使用“一快一慢双指针”的方法去解题。
class Solution { public: int removeElement(vector<int>& nums, int val) { int len = 0; for(int i = 0;i < nums.size(); ++i) if (nums[i] != val) nums[len++] = nums[i]; return len; } };
原文：http://www.cnblogs.com/jdneo/p/4761476.html