#include <iostream>
#include<vector>
using namespace std;
class Solution {
public:
void moveZeroes(vector<int>& nums) {
// create a vector which store all the elements rather than 0
vector<int> v1;
int count;
// Run the loop for the given problems
for(int i=0;i<nums.size();i++){
if(nums[i]!=0){
v1.push_back(nums[i]);
}
else{
count=count+1;
}
}
// The left over elelments should be stored after the non zero elements
}
};
int main() {
// your code goes here
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTx2ZWN0b3I+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwpjbGFzcyBTb2x1dGlvbiB7CnB1YmxpYzoKICAgIHZvaWQgbW92ZVplcm9lcyh2ZWN0b3I8aW50PiYgbnVtcykgewogICAgICAgIC8vIGNyZWF0ZSBhIHZlY3RvciB3aGljaCBzdG9yZSBhbGwgdGhlIGVsZW1lbnRzIHJhdGhlciB0aGFuIDAKICAgICAgICB2ZWN0b3I8aW50PiB2MTsKICAgICAgICBpbnQgY291bnQ7CiAgICAgICAgLy8gUnVuIHRoZSBsb29wIGZvciB0aGUgZ2l2ZW4gcHJvYmxlbXMKICAgICAgICBmb3IoaW50IGk9MDtpPG51bXMuc2l6ZSgpO2krKyl7CiAgICAgICAgICAgIGlmKG51bXNbaV0hPTApewogICAgICAgICAgICAgICAgdjEucHVzaF9iYWNrKG51bXNbaV0pOwogICAgICAgICAgICAgIAogICAgICAgICAgICB9CiAgICAgICAgICAgIGVsc2V7CiAgICAgICAgICAgIAljb3VudD1jb3VudCsxOwogICAgICAgICAgICB9CiAgICAgICAgICAgIAkKICAgICAgICAgICAgfQogICAgICAgICAgICAKICAvLyBUaGUgbGVmdCBvdmVyIGVsZWxtZW50cyBzaG91bGQgYmUgc3RvcmVkIGFmdGVyIHRoZSBub24gemVybyBlbGVtZW50cyAKICAgCiAgICAgICAgfQp9OwogICAgICAgIAogICAgCgoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglyZXR1cm4gMDsKfQ==