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.

链接： http://leetcode.com/problems/move-zeroes/

3/7/2017

public class Solution {
    public void moveZeroes(int[] nums) {
        if (nums.length == 0) return;
        int i = 0, j = 0, count = 0;
        while (j < nums.length) {
            if (nums[j] == 0) {
                j++;
                count++;
                continue;
            }
            if (count > 0) nums[i] = nums[j];
            i++;
            j++;
        }
        while (i < nums.length) {
            nums[i++] = 0;
        }        
    }
}

别人的算法更加简洁，大致上是一样的。

4/16/2017

BB电面准备

public class Solution {
    public void moveZeroes(int[] nums) {
        if (nums == null || nums.length == 0) return; 
        int i = 0;
        for (int j = 0; j < nums.length; j++) {
            if (nums[j] == 0) continue;
            else {
                if (i == j) {
                    i++; 
                    continue;
                }
                nums[i++] = nums[j];
            }
        }
        while (i < nums.length) nums[i++] = 0;
        return;
    }
}