283. Move Zeroes

最新推荐文章于 2021-08-03 19:54:12 发布

情谊风月

最新推荐文章于 2021-08-03 19:54:12 发布

阅读量262

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法

本文链接：https://blog.youkuaiyun.com/weixin_43320847/article/details/86697253

数据结构与算法专栏收录该内容

14 篇文章

订阅专栏

本文介绍了一种高效算法，用于将数组中的所有零元素移动到数组的末尾，同时保持非零元素的相对顺序。算法通过一次遍历实现，无需额外空间，降低了操作次数，适用于Java在线提交，执行速度优于100%的提交。

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

description：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.

Example:

Input: [0,1,0,3,12]
Output: [1,3,12,0,0]

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

First Edition

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

SECOND EDITION

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

Runtime: 1 ms, faster than 100.00% of Java online submissions for Move Zeroes.

THIRD EDITION

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