19.常用集合算法-set_intersection

#include<iostream>
using namespace std;

#include<set>
#include<vector>
#include<algorithm>

//常用集合算法
//set_intersection求两个容器的交集
//set_union求两个容器的并集
//set_difference求两个容器的差集

void test1901()
{
    vector<int> v1, v2;
    vector<int> vTarget;

    for (int i = 0; i < 10; i++)
    {
        v1.push_back(i);
        v2.push_back(i + 5);
    }

    vTarget.resize(min(v1.size(), v2.size()));//min取两个集合中元素个数最少的值

    vector<int>::iterator itEnd=set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());//保存返回的交集最后一个元素的迭代器

    for (vector<int>::iterator it = vTarget.begin(); it != itEnd; it++)//使用返回的迭代器作为循环结束条件
    {
        cout << (*it) << " ";
    }
    cout << endl;
}
int main()
{

    test1901();
    system("pause");
    return 0;
}