[LeetCode]27. Remove Element

题目描述

思路

遍历数组
如果是要删除的数字，则统计数deleteCount+1
如果不是，则将当前位置的数字前移deleteCount位

代码

#include <iostream>#include <vector>using namespace std;class Solution {public:    int removeElement(vector<int>& nums, int val) {        int deleteCount = 0;        for (int i = 0; i < nums.size(); ++i) {            if (nums[i] == val)                ++deleteCount;            else                nums[i - deleteCount] = nums[i];        }        return nums.size() - deleteCount;    }};int main() {    vector<int> nums = { 3,2,2,3 };    Solution s;    cout << s.removeElement(nums, 2) << endl;    system("pause");    return 0;}