编写一个pattern recognition‘函数来查找按特定顺序出现的数字? c++

#include <iostream>
#include <vector>

bool patternRecognition(const std::vector<int>& numbers, const std::vector<int>& pattern) {
    int patternIndex = 0;  // 模式数组的索引

    for (int i = 0; i < numbers.size(); i++) {
        if (numbers[i] == pattern[patternIndex]) {
            patternIndex++;  // 匹配到模式中的数字，模式索引加1
        }

        if (patternIndex == pattern.size()) {
            return true;  // 所有模式数字都已匹配，返回true
        }
    }

    return false;  // 未找到按特定顺序出现的数字，返回false
}

int main() {
    std::vector<int> numbers = {1, 2, 3, 4, 5, 6, 7, 8, 9};
    std::vector<int> pattern = {2, 4, 6};

    bool foundPattern = patternRecognition(numbers, pattern);

    if (foundPattern) {
        std::cout << "Pattern found!" << std::endl;
    } else {
        std::cout << "Pattern not found!" << std::endl;
    }

    return 0;
}