STL 之 vector A数组是否包含B数组(一副手牌中是否有某种指定类型的牌)

#include <iostream>#include <vector>using namespace std;//数据元素int a[] = {3,5,5,5,5,5,5,6,7,8,9}; int b[] = {3,5,5,5,5,5,5,6,9};//用数组初始化vectorvector<int> v1(a, a + sizeof(a) / sizeof(a[0]));vector<int> v2(b, b + sizeof(b) / sizeof(b[0]));;//函数实现bool isContains(const vector<int>& v1, const vector<int>& v2){int c = 0;for(int i = 0; i < v1.size(); i++){if(v1[i] == v2[c])   //一个个依次查找等于容器2索引的元素{if(c == v2.size()-1)return true;c++;}}    return false;}void main(){if(isContains(v1, v2))cout<<"Yes"<<endl;elsecout<<"No"<<endl;}