一道简单的动态规划题

字符串通配 “?”表示单个，“*”表示很多个;
如“asdferg”与“a?d*”是匹配的。
下面就贴个代码好了，也不难。暴力递归写出来再优化就好了

#include"stdafx.h"
#include <iostream>
#include <sstream>
#include <string>
#include <stdlib.h>
#include <stdio.h>
#include<vector>
#include<stack>
#include<set>
using namespace std;
int main() {
    char *s = "aacbbb", *p = "a*b";
    int n = strlen(s);
    int m = strlen(p);
    int **f = new int*[n + 1];
    for (int i = 0; i < n + 1; i++)
        f[i] = new int[m + 1];
    for (int i = 0; i < n + 1; i++)
        for (int j = 0; j < m + 1; j++)
            f[i][j] = 0;
    f[0][0] = 1;
    for (int i = 1; i <= n; i++)
        f[i][0] = 0;
    for (int i = 1; i <= m; i++)
        f[0][i] = f[0][i - 1] && (p[i - 1] == '*');
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (p[j - 1] == '*') {
                f[i][j] = f[i - 1][j] || f[i][j - 1];
            }
            else if (p[j - 1] == '?') {
                f[i][j] = f[i - 1][j - 1];
            }
            else {
                f[i][j] = f[i - 1][j - 1] && (s[i - 1] == p[j - 1]);
            }
        }
    }
    if (f[n][m] == 1)
        cout << "true";
    else
        cout << "false";
    for (int i = 0; i < n + 1; i++)
        delete[] f[i];
    delete[] f;
    return 0;
}