std::remove does not change the size of the container,it moves elements forward to fill gaps created and returns the new 'end' position. : remove « STL Algorithms Modifying sequence operations « C++ Tutorial

1. C++ Tutorial
2. STL Algorithms Modifying sequence operations
3. remove

#include <algorithm>
#include <vector>
#include <list>
#include <iostream>

using namespace std;

int main (){
    list <int> l;

    for (int nCount = 0; nCount < 10; ++ nCount)
        l.push_back (nCount);

    list <int>::const_iterator li;
    for ( li = l.begin (); li != l.end (); ++ li )
        cout << *li << ' ';

    vector <int> v (l.size () * 2);

    vector <int>::iterator iLastPos;
    iLastPos = copy ( l.begin (), l.end (), v.begin () );

    vector <int>::iterator i;
    i = remove (v.begin (), v.end (), 0);

    v.erase (i , v.end ());
    vector <int>::iterator vi;
    for ( vi = v.begin (); vi != v.end (); ++ vi )
        cout << *vi << ' ';

    return 0;
}