283. Move Zeroes – Xiaoxu Meng

Description:

https://leetcode.com/problems/move-zeroes/#/description

Algorithm:

Use swap.

Code:

class Solution {
public:
    void moveZeroes(vector&amp; nums) {
        int numNonZero = 0;
        for (int i = 0; i &lt; nums.size();i++)
            if (nums[i] != 0) swap(nums[numNonZero++], nums[i]);
    }
};

class Solution {

public:

void moveZeroes(vector& nums) {

int numNonZero = 0;

for (int i = 0; i < nums.size();i++)

if (nums[i] != 0) swap(nums[numNonZero++], nums[i]);

}

};

Time & Space:
O(n) & O(1)

Leave a Reply Cancel reply