【LeetCode】283. Move Zeroes

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

我在天上飘

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

阅读量221

点赞数

CC 4.0 BY-SA版权

分类专栏：【LeetCode】

本文链接：https://blog.youkuaiyun.com/qq_27991659/article/details/50825576

【LeetCode】专栏收录该内容

127 篇文章

订阅专栏

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.

[思路]

把非零元素提取出来按顺序前置，后面位置全部置为0.

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