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.
//O(n),O(1) class Solution{ public: int removeElement(vector<int>& nums, int target){ int index = 0; for(int i = 0; i < nums.size(); ++i){ if(nums[i] != target){ nums[index++] = nums[i]; } } return index; } }; class Solution{ public: int removeElement(vector<int>& nums, int target){ return distance(nums.begin(),remove(nums.begin(),nums.end(),target)); } };
原文：https://www.cnblogs.com/hujianglang/p/11415695.html