常用集合算法set

黑马263
#include
#include
#include
#include
using namespace std;
void myprint(int val)
{
cout << val << endl;
}
void test01()
{
vectorv1;
vectorv2;
for (int i = 0; i < 10; i++)
{
v1.push_back(i);
v2.push_back(i + 5);
}
vectorvTarget;
vTarget.resize(max(v1.size(), v2.size()));
vector::iterator it=set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
for_each(vTarget.begin(),it, myprint);

vectorvTarget1;
vTarget1.resize(max(v1.size(), v2.size()));
it = set_difference( v2.begin(), v2.end(),v1.begin(), v1.end() , vTarget.begin());
for_each(vTarget.begin(), it, myprint);

}
int main()
{
test01();
}