[LeetCode] 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.

这道题注意是要求不能新建array来完成。所以与其想办法判断怎么移动。不如直接把所有!=0的数字按顺序提前，那么剩下的0自然就在后面了。

代码如下。~

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

public void swapping(int j,int i, int[] nums){
    int temp=nums[j];
    nums[j]=nums[i];
    nums[i]=temp;
}
}

[LeetCode] Move Zeroes

原文：http://www.cnblogs.com/orangeme404/p/4865635.html