leetcode 283: Move Zeroes

Move Zeroes

Total Accepted: 858 Total Submissions: 1878 Difficulty: Easy

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.

[思路]

维持两个指针.

[CODE]

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