W3School TIY Editor

#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { vector<int> numbers = {1, 7, 3, 5, 3, 9, 2}; vector<int> search = {2, 3, 5}; // 对 numbers 向量进行排序 sort(numbers.begin(), numbers.end()); // 检查 search 向量是否包含在 numbers 中 if (includes(numbers.begin(), numbers.end(), search.begin(), search.end())) { cout << "已找到"; } else { cout << "未找到"; } return 0; }