Move Zeroes

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

Note that you must do this in-place without making a copy of the array.

Example 1:

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

Example 2:

Input: nums = [0]
Output: [0]

Constraints:

• 1 <= nums.length <= 104
• -231 <= nums[i] <= 231 - 1

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

标签：Zeroes,nums,int,Move,++,Input,Output,array
来源： https://blog.csdn.net/u013325815/article/details/123030214