leetcode 283. Move Zeroes

最新推荐文章于 2024-09-01 11:29:54 发布

ULtrapp

最新推荐文章于 2024-09-01 11:29:54 发布

阅读量211

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/lvchaocccc/article/details/51984243

版权

leetcode 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

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:

You must do this in-place without making a copy of the array.
Minimize the total number of operations.

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

Subscribe to see which companies asked this question

思考：思路是每次移动一个零到最后，有点想冒泡排序，直到最后所有的零都在后边没法移动为止。

public class Solution {
    public void moveZeroes(int[] nums) {
        while(moveOneZeroToEnd(nums) == false);
    }

    public boolean moveOneZeroToEnd(int[] nums){
        int fz = 0;
        for(int num : nums){
            if(num != 0){
                fz++;
            }else{
                break;
            }
        }//find first 0
        boolean noFZ = true;
        for(int i = fz; i < nums.length; ++i){
            if(nums[i] != 0){
                int temp = nums[i];
                nums[i] = nums[fz];
                nums[fz] = temp;
                fz = i;
                noFZ = false;
            }
        }

        return noFZ;

    }
}