数组移0到末尾（不能新建数组）

java会写一手好熊

于 2018-03-08 16:49:22 发布

阅读量536

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_18182057/article/details/79486715

本文介绍了一种方法，可以在不复制原始数组的情况下将所有零元素移动到数组的末尾，同时保持非零元素的相对顺序。这种方法通过计数并重新分配非零元素来实现，最后填充剩余位置为零。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
    public void moveZeroes(int[] nums) {
        if (nums == null || nums.length == 0) return;   
        int count = 0;
        for(int num : nums){
            if(num!=0) nums[count++] = num;
        }
        while(count<nums.length)
            nums[count++] = 0;
    }
}