Move Zeroes

• Time : $O(n)$
• Space : $O(1)$

vector<int> Solution::solve(vector<int> &A) {
    int p = 0;
    for(int i = 0; i < A.size(); i++) {
        if(A[i]) A[p++] = A[i];
    }
    while(p < A.size()) A[p++] = 0;
    return A;
}