[LintCode] 正则表达式匹配

 class Solution {
 public:
     /**
      * @param s: A string
      * @param p: A string includes "." and "*"
      * @return: A boolean
      */
     bool isMatch(const char *s, const char *p) {
         // write your code here
         int m = strlen(s), n = strlen(p);
         vector<vector<bool> > dp(m + , vector<bool> (n + , false));
         dp[][] = true;
         for (int j = ; j <= n; j++)
             dp[][j] = (j >  && p[j - ] == '*' && dp[][j - ]);
         for (int j = ; j <= n; j++) {
             for (int i = ; i <= m; i++) {
                 if (j >  && p[j - ] == '*')
                     dp[i][j] = dp[i][j - ] || ((s[i - ] == p[j - ] || p[j - ] == '.') && dp[i - ][j]);
                 else dp[i][j] = dp[i - ][j - ] && (s[i - ] == p[j - ] || p[j - ] == '.');
             }
         }
         return dp[m][n];
     }
 };