算法--leetcode-283-移动零

public class Test {
    public static void main(String[] args) {

        Integer[] arr = {1, 3, 5, 0, 7, 0, 0, 0, 8, 9};

        int j = 0;
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] != 0) {
               int temp = arr[j];
               arr[j] = arr[i];
               arr[i] = temp;
               j++;
            }
        }
        System.out.println(Arrays.toString(arr));
    }
}