Thread: uniue algorithm

I have three vectors.
I want to remove duplicates within each vector.
I've tried using

Code:

vector.erase(uniqe(vector.begin(),vector.end())

but that removes elements not unique to all the vectors.
Am I not using this algorithm correctly or is there another way
to accomplish this?

To remove duplicate elements within a vector, you must first ensure that the elements within the vector are sorted. The unique function returns an iterator representing the new logical end of the container. The erase member function for vectors must then be called to actually remove the elements from this logical end position to the real end position. This is close to what you had but there were a couple things you missed.

Code:

#include <algorithm>
#include <vector>
using namespace std;
...
vector<int> IntVector;
...
sort( IntVector.begin(), IntVector.end() ); // Make sure vector is sorted first
IntVector.erase( unique(IntVector.begin(),IntVector.end()), IntVector.end() );

You mispelled 'unique' in your implementation (a typo?) and forgot the second argument to the erase function but that is it. This should work.