我有这个功能
vector<string> instersection(const vector<string> &v1, const vector<string> &v2);
我有两个字符串向量,我想找到两者中都存在的字符串,然后用公共元素填充第三个向量.
I have two vectors of strings and I want to find the strings that are present in both, which then fills a third vector with the common elemnts.
如果我的向量是...
v1 = <"a","b","c">
v2 = <"b","c">
尝试 std::set_intersection
,例如:
Try std::set_intersection
, for example:
#include <algorithm> //std::sort
#include <iostream> //std::cout
#include <string> //std::string
#include <vector> //std::vector
std::vector<std::string> intersection(std::vector<std::string> &v1,
std::vector<std::string> &v2){
std::vector<std::string> v3;
std::sort(v1.begin(), v1.end());
std::sort(v2.begin(), v2.end());
std::set_intersection(v1.begin(),v1.end(),
v2.begin(),v2.end(),
back_inserter(v3));
return v3;
}
int main(){
std::vector<std::string> v1 {"a","b","c"};
std::vector<std::string> v2 {"b","c"};
auto v3 = intersection(v1, v2);
for(std::string n : v3)
std::cout << n << ' ';
}
这篇关于C++中的向量交集的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持跟版网!