10. Regular Expression Matching

Implement regular expression matching with support for '.' and '*'.

'.' Matches any single character.
'*' Matches zero or more of the preceding element.

The matching should cover the entire input string (not partial).

The function prototype should be:
bool isMatch(const char *s, const char *p)

Some examples:
isMatch("aa","a") → false
isMatch("aa","aa") → true
isMatch("aaa","aa") → false
isMatch("aa", "a*") → true
isMatch("aa", ".*") → true
isMatch("ab", ".*") → true
isMatch("aab", "c*a*b") → true

思路1，DP

refer to monkeytocrazy: https://discuss.leetcode.com/topic/40371/easy-dp-java-solution-with-detailed-explanation

1, If p.charAt(j) == s.charAt(i) :  dp[i][j] = dp[i-1][j-1];
2, If p.charAt(j) == '.' : dp[i][j] = dp[i-1][j-1];
3, If p.charAt(j) == '*': 
   here are two sub conditions:
               1   if p.charAt(j-1) != s.charAt(i) : dp[i][j] = dp[i][j-2]  //in this case, a* only counts as empty
               2   if p.charAt(i-1) == s.charAt(i) or p.charAt(i-1) == '.':
                              dp[i][j] = dp[i-1][j]    //in this case, a* counts as multiple a 
                           or dp[i][j] = dp[i][j-1]   // in this case, a* counts as single a
                           or dp[i][j] = dp[i][j-2]   // in this case, a* counts as empty

初始化：x*x*x* can match empty string s

public boolean isMatch(String s, String p) {
        if(s==null||p==null) return false;
        int M = s.length(), N = p.length();
        boolean[][] r = new boolean[M+1][N+1];
        r[0][0]=true;
        //initialization: x*x*x* can match empty string s
        for (int i = 1; i < p.length(); i=i+2) {
            if (p.charAt(i) == '*') {
                r[0][i+1] = r[0][i-1];
            }
            else break;
        }
        for(int i=0; i<M; i++){
            for(int j=0; j<N;j++){
                if(p.charAt(j)!='*'){ // pj is not *, then in the following two cases, pj matches si.
                    if(p.charAt(j)=='.' || p.charAt(j)==s.charAt(i)){
                        r[i+1][j+1] = r[i][j];
                    }
                }
                else{ // pj is *
                    // in the following two cases, * match 0 times pj-1
                    if(p.charAt(j-1)!='.' && p.charAt(j-1)!=s.charAt(i)){
                        r[i+1][j+1] = r[i+1][j-1];
                    }
                    // * match 0, 1, or many times of pj-1
                    else{
                        r[i+1][j+1] = r[i+1][j-1] || r[i+1][j] || r[i][j+1];
                    }
                }
            }
        }
        return r[M][N];
    }

思路2:

refer to https://discuss.leetcode.com/topic/12289/clean-java-solution

不错的总结： http://www.cnblogs.com/jdflyfly/p/3810681.html