**LeetCode-Regular Expression Matching

太麻烦了！！！

recursive的方法是围绕 p第二位是不是＊来分的

首先要判断p是否为空 然后return slen == 0注意不能反过来 假如s是空 然而p不是空 也是有可能的！

假如是＊那么分几种可能的情况 其中要注意的是当 s的第一位和p的第二位相匹配了 不要就把第一位以及＊扔掉 仍然留着和后面匹配 因为aa 和 a*的情况 第二个a还需要＊

public class Solution {
    public boolean isMatch(String s, String p) {
        int slen = s.length();
        int plen = p.length();
        if ( plen == 0 )
            return slen == 0;
        if ( plen > 1 && p.charAt( 1 ) == '*' ){
            return slen != 0 && (s.charAt(0) == p.charAt(0) || p.charAt( 0 ) =='.' ) && isMatch( s.substring( 1 ), p) || isMatch( s, p.substring( 2 ));
        }
        else
            return slen != 0 && ( s.charAt(0) == p.charAt (0) || p.charAt( 0 ) =='.') && isMatch ( s.substring ( 1 ), p.substring( 1 ) );
    }
}

dp的方法改天吧！！

class Solution {
public:
    bool isMatch(string s, string p) {
        /**
         * f[i][j]: if s[0..i-1] matches p[0..j-1]
         * if p[j - 1] != '*'
         *      f[i][j] = f[i - 1][j - 1] && s[i - 1] == p[j - 1]
         * if p[j - 1] == '*', denote p[j - 2] with x
         *      f[i][j] is true iff any of the following is true
         *      1) "x*" repeats 0 time and matches empty: f[i][j - 2]
         *      2) "x*" repeats >= 1 times and matches "x*x": s[i - 1] == x && f[i - 1][j]
         * '.' matches any single character
         */
        int m = s.size(), n = p.size();
        vector<vector<bool>> f(m + 1, vector<bool>(n + 1, false));

        f[0][0] = true;
        for (int i = 1; i <= m; i++)
            f[i][0] = false;
        // p[0.., j - 3, j - 2, j - 1] matches empty iff p[j - 1] is '*' and p[0..j - 3] matches empty
        for (int j = 1; j <= n; j++)
            f[0][j] = j > 1 && '*' == p[j - 1] && f[0][j - 2];

        for (int i = 1; i <= m; i++)
            for (int j = 1; j <= n; j++)
                if (p[j - 1] != '*')
                    f[i][j] = f[i - 1][j - 1] && (s[i - 1] == p[j - 1] || '.' == p[j - 1]);
                else
                    // p[0] cannot be '*' so no need to check "j > 1" here
                    f[i][j] = f[i][j - 2] || (s[i - 1] == p[j - 2] || '.' == p[j - 2]) && f[i - 1][j];

        return f[m][n];
    }
};