【Leetcode】：Move Zeroes问题 in JAVA

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.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [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.

题目的大意是：给定一个数组，把所有的0放在数组的最后面，同时保证非0数的顺序不变

下面是使用Java的解答

public class Solution {    public void moveZeroes(int[] nums) {        int n0 = 0;//代表已经记录到的0的数量        for (int i = 0; i < nums.length; i++) {        if (nums[i] == 0) {                n0++;        } else if (n0 != 0){                nums[i-n0] = nums[i];         nums[i] = 0;                }        }    }}