283. Move Zeroes(C++/Java)

最新推荐文章于 2025-04-09 11:56:09 发布

原创最新推荐文章于 2025-04-09 11:56:09 发布 · 279 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

79 篇文章

订阅专栏

Array

41 篇文章

订阅专栏

本文介绍了一种算法，该算法可以将数组中的所有零元素移动到数组的末尾，同时保持非零元素的相对顺序不变。提供了一个C++和Java实现的例子，并强调了在不复制数组的情况下进行操作。

注：此博客不再更新，所有最新文章将发表在个人独立博客limengting.site。分享技术，记录生活，欢迎大家关注

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.

C++:

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        if (nums.empty() || nums.size() == 0) return;
        
        int insertPos = 0;
        for (auto num : nums) {
            if (num != 0) nums[insertPos++] = num;
        }
        
        while (insertPos < nums.size()) {
            nums[insertPos++] = 0;
        }
    }
};

Java:

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