W3School TIY Editor

#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { vector<int> numbers = {1, 7, 3, 5, 9, 2}; vector<int> other = {9, 7, 5, 3, 2, 1}; if (is_permutation(numbers.begin(), numbers.end(), other.begin())) { cout << "找到排列组合"; } else { cout << "未找到排列组合"; } return 0; }