leetcode刷题之 数组与矩阵(1):把数组中的 0 移到末尾

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

 

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

 

这道题让我们将一个给定数组中所有的0都移到后面，把非零数前移，要求不能改变非零数的相对应的位置关系，而且不能拷贝额外的数组，那么只能用替换法in-place来做，需要用两个指针，一个不停的向后扫，找到非零位置，然后和前面那个指针交换位置即可，参见下面的代码：

 

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

class Solution {
    public void moveZeroes(int[] nums) {
        for(int i = 1; i < nums.length; i++){
            int diff = 1;
            while(i >= diff && nums[i-diff] == 0){
                swap(nums, i-diff, i-diff+1);
                diff++;
            }
        }
    }
    private void swap(int[] nums, int i, int j){
            int t = nums[i];
            nums[i] = nums[j];
            nums[j] = t;
        }
}