import java.util.Arrays;
class Solution {
public void moveZeroes(int[] nums) {
//外层循环最少要L-1次
int L = nums.length ;
for(int i = 0;i < L - 1;i++) {
for(int j = 0;j < L-1;j++) {
if((nums[j] == 0 )&&( nums[j + 1] != 0)) {//{0,0,1}
nums[j] = nums[j + 1];
nums[j + 1] = 0;
}
}
}
System.out.println(Arrays.toString(nums));
}
}