#include <iostream> #include <vector> using namespace std; // 动态规划,str包含?或* int isMatch(string str, string s){ vector<vector<int>> dp(str.size()+1, vector<int>(s.size()+1,0)); dp[0][0] = 1; for (int i = 1; i <= str.size(); ++i){ dp[i][0] = dp[i-1][0] && (str[i-1] == ...