[leetcode] 27. Remove Element 解题报告

题目链接：https://leetcode.com/problems/remove-element/

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.

思路：和move zero的题目差不多

代码如下：

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) swap(nums[i], nums[k++]);
return k;
}
};