283. 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.

双指针，i指针左侧保留大于零的元素，j指针左侧保留等于零的元素。

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