283. Move Zeroes

本文主要是介绍283. Move Zeroes，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Note that you must do this in-place without making a copy of the array.

Example 1:

Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]
Example 2:

Input: nums = [0]
Output: [0]

Constraints:

1 <= nums.length <= 104
-231 <= nums[i] <= 231 - 1

Follow up: Could you minimize the total number of operations done?

Solution:

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int le = 0;
        int ri = 0;
        while(ri != nums.size())
        {
            if(nums[ri] != 0)
            {
                swap(nums[le], nums[ri]);
                le++;
            }
            ri++;
        }
    }
};

这篇关于283. Move Zeroes的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！