LeetCode——Move Zeroes

Description：

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.

时空复杂度都在O(n)内

public class Solution {
    public void moveZeroes(int[] nums) {
        
        //nums = [0, 1, 0, 3, 12]->[1, 3, 12, 0, 0]
        for(int i=0,j=0; i<nums.length; i++) {
            if(nums[i]!=0) {
                int t = nums[i];
                nums[i] = nums[j];
                nums[j] = t;
                j ++;
            }
        }
        
    }
}

LeetCode——Move Zeroes

原文：http://www.cnblogs.com/wxisme/p/4841352.html