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.
Example:
Input: [0,1,0,3,12]
Output: [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.
Solutions
🧠 Cpp
#include <algorithm>
class Solution {
public:
void moveZeroes(vector<int>& nums)
{
unsigned num0 = std::count(nums.begin(), nums.end(), 0);
std::remove_if(nums.begin(), nums.end(), [](int a){if(a == 0) return true; return false;});
std::fill(nums.end() - num0, nums.end(), 0);
}
};
Last updated
Was this helpful?