283. Move Zeroes

發表於 | 分類於

problem

solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
public:
    int removeElement(vector<int>& nums, int val){
        int slow= -1, fast =0, n=nums.size();
        while(fast<n){
            if(nums[fast]!=val) nums[++slow] = nums[fast];
            fast++;
        }
        return slow+1;
    }
    void moveZeroes(vector<int>& nums) {
        
        int pos = removeElement(nums,0);
        for(int i=pos;i<nums.size();++i) nums[i] = 0;
    }
};

analysis

  • time complexity O(n)
  • space complexity O(1)