283. Move Zeroes

283. Move Zeroes

Easy

220879FavoriteShare

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Example:

Input: [0,1,0,3,12]
Output: [1,3,12,0,0]

Note:

1. You must do this in-place without making a copy of the array.
2. Minimize the total number of operations.

class Solution {
    public void moveZeroes(int[] nums) {
        int i = 0;
        for(int j = 0; j < nums.length; j++){
            if(nums[j] != 0){
                nums[i++] = nums[j];
            }
        }
        for(int j = i; j < nums.length; j++){
            nums[j] = 0;
        }
    }
}

思路和remove element很像，不过更简单，不是0的先进来，后面的全补为0.