华为机试：字符串通配符

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
using namespace std;

bool isMatch(string s, string p) {
    int m = p.size(), n = s.size();
    vector<vector<bool>> dp(m + 1, vector<bool>(n + 1, false));
    dp[0][0] = true;
    for (int i = 1; i <= m; i++) {
        if (p[i - 1] == '*') {
            dp[i][0] = dp[i - 1][0];
        }
        for (int j = 1; j <= n; j++) {
            if (p[i - 1] != '*' && p[i - 1] != '?' && p[i - 1] != s[j - 1]) {
                dp[i][j] = false;
            }
            if (p[i - 1] == '?') {
                dp[i][j] = (dp[i - 1][j - 1] && isalnum(s[j - 1]));
            }
            if (p[i - 1] == s[j - 1]) {
                dp[i][j] = dp[i - 1][j - 1];
            }
            if (p[i - 1] == '*') {
                dp[i][j] = dp[i - 1][j] || dp[i][j - 1];
            }
        }
    }
    return dp[m][n];
}

int main() {
    string s, p;
    cin >> p >> s;
    for (int i = 0; i < s.size(); i++) {
        s[i] = tolower(s[i]);
    }
    for (int i = 0; i < p.size(); i++) {
        p[i] = tolower(p[i]);
    }
    bool ans = isMatch(s, p);
    cout << (ans ? "true" : "false") << endl;
    return 0;
}