LeetCode 283. Move Zeroes

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

sqyx008

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

阅读量250

点赞数

分类专栏： LeetCode 文章标签： leetcode array cpp vector pointer

本文链接：https://blog.csdn.net/sqyx008/article/details/70399379

版权

LeetCode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

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.

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.

Analysis

把所有非0元素提到前面来，尾部赋上适当数量的0即可。需要设置两个指针变量，一个用来遍历，另一个用来控制非0元素的“提前”。

Code

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int n = nums.size(), j = 0, i;
        for (i = 0; i < n; i++)
            if (nums[i] != 0)
                nums[j++] = nums[i];
        for (i = j; i < n; i++)
            nums[i] = 0;
    }
};