leetCode 283. Move Zeroes 數(shù)組

發(fā)布時(shí)間：2020-07-19 18:46:24 來(lái)源：網(wǎng)絡(luò) 閱讀：439 作者：313119992 欄目：編程語(yǔ)言

283. Move Zeroes

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.

題目大意：

將數(shù)組中元素為0的元素放到數(shù)組的后面，但是數(shù)組中其他非0元素，保持原來(lái)的順序。

代碼如下：

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

2016-08-12 01:26:32

向AI問(wèn)一下細(xì)節(jié)

leetCode 283. Move Zeroes 數(shù)組

猜你喜歡

最新資訊

相關(guān)推薦

相關(guān)標(biāo)簽