Day 4 of 30-Day LeetCode Challenge

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.

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

}
};