leetcode-27 remove element

 1 class Solution {
 2 public:
 3     int removeElement(vector<int>& nums, int val) {
 4       int count = 0;
 5     for(int i = 0 ; i < nums.size() ; ++i) {
 6         if(nums[i] == val)
 7             count++;
 8         else
 9             nums[i-count] = nums[i];
10     }
11     return nums.size()-count;
12     }
13 };

这道题比较简单，和前面去重复的元素类似

转载于:https://www.cnblogs.com/illfuckingkyzb/p/10140982.html