Java [Leetcode 283]Move Zeroes

题目描述：

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.

解题思路：

将数组中的非零数字往前压缩，剩余的位置补零。

代码如下：

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