Leetcode刷题

Problem 283

Posted by Ruizhi Ma on November 25, 2020

Solution URL

https://leetcode.com/submissions/detail/424028480/

代码

class Solution {
    public void moveZeroes(int[] nums) {
        //time: O(n)
        //space: O(1)
        int fast = 0, slow = 0;
        while(fast < nums.length){
            if(nums[fast] != 0){
                nums[slow++] = nums[fast++];
            }else{
                fast++;
            }
        }

        for(int i = slow; i < nums.length; i++){
            nums[i] = 0;
        }
    }
}