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

从后往前遍历，为0的数和后面所有的数交换，复杂度为n²

一刷：

    public void moveZeroes(int[] nums) {
        int zeros=0;
        for (int i = nums.length - 1; i >= 0; i--) {
            if (nums[i] == 0){
                for (int j = i; j < nums.length - 1 ; j++) {
                    nums[j] = nums[j+1];
                }
                nums[nums.length-zeros-1] = 0;
                zeros += 1;
            }
        }
    }

[leetcode] 283. Move Zeroes 解题报告

标签：

原文地址：http://www.cnblogs.com/pulusite/p/5840687.html