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/

题解：

把0都移动到队尾。这道题在Bloomberg的电面里还真被问到过。

Time Complexity - O(n)， Space Complexity - O(1)。

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

Reference:

283. Move Zeroes

标签：

原文地址：http://www.cnblogs.com/yrbbest/p/5037884.html