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：* 这里是指’*’号前一个字符可以出现0个或多个，而且*前面的字符有可能是’.’

主要分：

p[j] != '*' : if s[i] == p[j] || p[j]=='.' , 则： dp[i][j] == dp[i-1][j-1]

p[j] == '*' :  if s[i] !=p[j-1] ,则代表根本无法match，dp[i][j] = dp[i][j-2];

                  if s[i] ==p[j-1] || p[j-1]=='.', 则代表可以match 0个或者多个。 dp[i][j] = dp[i][j-2] || dp[i-1][j];  

dp[i][j-2] 代表match 0 个，dp[i-1][j] 代表match1个(也就是match 多个)

class Solution {
    public boolean isMatch(String s, String p) {
        int m = s.length();
        int n = p.length();
        boolean[][] dp = new boolean[m + 1][n + 1];
        dp[0][0] = true;
        // 1st row;
        for(int j = 1; j <= n; j++) {
            if(j - 2 >= 0 && p.charAt(j - 1) == '*') {
                dp[0][j] = dp[0][j - 2];
            }
        }
        
        // 1st col;
        for(int i = 1; i <= m; i++) {
            dp[i][0] = false;
        }
        
        // calculate matrix;
        for(int i = 1; i <= m; i++) {
            for(int j = 1; j <= n; j++) {
                if(p.charAt(j - 1) != '*') {
                    if(s.charAt(i - 1) == p.charAt(j - 1) || p.charAt(j - 1) == '.') {
                        dp[i][j] = dp[i - 1][j - 1];
                    }
                } else {
                    // p.charAt(j - 1) == '*';
                    // 什么也不match，default就是等于dp[i][j - 2];
                    dp[i][j] = dp[i][j - 2];
                    if(s.charAt(i - 1) == p.charAt(j - 2) || p.charAt(j - 2) == '.') {
                        dp[i][j] |= dp[i][j] || dp[i - 1][j];
                    }
                }
            }
        }
        return dp[m][n];
    }
}