1.     bool isMatch(string s, string p) {
    2.         int m = s.length(), n = p.length(); 
    3.         vector<vector<bool> > dp(m + 1, vector<bool> (n + 1, false));
    4.         dp[0][0] = true;
    5.         for (int i = 0; i <= m; i++)
    6.             for (int j = 1; j <= n; j++)
    7.                 if (p[j - 1] == '*')
    8.                     dp[i][j] = dp[i][j - 2] || (i > 0 && (s[i - 1] == p[j - 2] || p[j - 2] == '.') && dp[i - 1][j]);
    9.                 else dp[i][j] = i > 0 && dp[i - 1][j - 1] && (s[i - 1] == p[j - 1] || p[j - 1] == '.');
    10.         return dp[m][n];
    11.     }