LeetCode 283. Move Zeroes

原题链接在这里：https://leetcode.com/problems/move-zeroes/

题目：

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:

[0,1,0,3,12]
[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.

题解：

设置insertPo = 0, 每当遇到非零数，就赋值到nums[insertPo]上，同时insertPo++.

最后insertPo到nums.length位都填0.

Time Complexity: O(n). n = nums.length.

Space O(1).

AC Java:

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

跟上Remove Element.