#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <list>
using namespace std;
int main()
{
int source[] = { 1, 4, 4, 6, 1, 2, 2, 3, 1, 6, 6, 6, 5, 7,
5, 4, 4 };
int sourceNum = sizeof(source)/sizeof(source[0]);
vector<int> coll;
copy (source, source+sourceNum, //source
back_inserter(coll)) ; //destination
copy (coll.begin(), coll.end(), ostream_iterator<int>(cout," "));
cout << "\n\n";
sort(coll.begin(),coll.end());
vector<int> :: iterator pos;
pos = unique (coll.begin(), coll.end());
copy (coll.begin(), coll.end(), ostream_iterator<int>(cout," "));
cout << "\n\n";
copy (coll.begin(), pos, ostream_iterator<int>(cout," "));
cout << "\n\n";
copy (source, source+sourceNum,coll.begin());
copy (coll.begin(), coll.end(),ostream_iterator<int>(cout," "));
cout << "\n\n";
//remove elements if there was a previous greater element
coll.erase (unique (coll.begin(), coll.end(),greater<int>()), coll.end());
copy (coll.begin(), coll.end(), ostream_iterator<int>(cout," "));
cout << "\n\n";
}
－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－－
但是當(dāng)要比較的數(shù)為計(jì)算所的的一個(gè)double，不能用sort和unique，怎么辦？有沒有好的辦法啊！謝謝！
比如要比較的vector是從屏幕是得到的點(diǎn)的x坐標(biāo)！坐標(biāo)是通過鼠標(biāo)時(shí)時(shí)得到！
要得到所有的不同的點(diǎn)的x坐標(biāo)？
（可以用近似的算法）