LeetCode moveZeroes

最新推荐文章于 2024-10-27 05:36:49 发布

yqtaowhu

最新推荐文章于 2024-10-27 05:36:49 发布

阅读量256

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/taoyanqi8932/article/details/52083735

版权

Leetcode 专栏收录该内容

113 篇文章 0 订阅

订阅专栏

// Date : 2016.08.01
// Author : yqtao
// https://github.com/yqtaowhu

/*****************************************************************************
*
* 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.
*
*****************************************************************************/

// this problem have much solution ,the below i think is very simple and quikly.
class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int j = 0;
        // move all the nonzero elements advance
        for (int i = 0; i < nums.size(); i++) {
            if (nums[i] != 0) {
                nums[j++] = nums[i];
            }
        }
        for (;j < nums.size(); j++) {
            nums[j] = 0;
        }
    }
};