leetcode：283. Move Zeroes（Java）解答

转载请注明出处：z_zhaojun的博客

原文地址：http://blog.csdn.net/u012975705/article/details/50493772

题目地址：https://leetcode.com/problems/move-zeroes/

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:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.

解法（java）：

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