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.
ps:这个题目同样是一个双指针的问题，比较简单，代码如下所示
1 class Solution { 2 public: 3 int removeElement(vector<int>& nums, int val) { 4 int pos = 0; 5 int sz = nums.size(); 6 for (int i = 0; i < sz; ++i){ 7 if (nums[i] != val){ 8 nums[pos++] = nums[i]; 9 } 10 } 11 return pos; 12 } 13 };
LeetCode OJ：Remove Element（移除元素）
原文：http://www.cnblogs.com/-wang-cheng/p/4855110.html