动态规划 - 正则匹配

public class RegularExpressionMatching {

    /**
     * @param s input string
     * @param p pattern
     * @return pattern matches the input string
     */
    public static boolean rem(String s, String p) {
        if (p == null || p.length() == 0 || p.startsWith("*")) {
            return false;
        }

        boolean[][] dp = new boolean[p.length()+1][s.length()+1];
        dp[0][0] = true;


        // i > 0, j > 0
        // i for pattern position
        for (int i = 1; i <= p.length(); i++) {
            char pc = p.charAt(i - 1);
            // j for input string position
            for (int j = i; j <= s.length(); j++) {
                if (!dp[i-1][j-1]) {
                    dp[i][j] = false;
                    continue;
                }
                if (pc == '.') {
                    dp[i][j] = true;
                } else if (pc == '*') {
                    if (p.charAt(i-2) == '.') {
                        while (j <= s.length()) {
                            dp[i][j++] = true;
                        }
                    } else {
                        while (j <= s.length() && p.charAt(i-2) ==  s.charAt(j-1)) {
                            dp[i][j++] = true;
                        }
                    }
                } else {
                    if (p.charAt(i-1) == s.charAt(j-1)) {
                        dp[i][j] = true;
                    }
                }
            }
        }

        return dp[p.length()][s.length()];
    }



    public static void main(String[] args) {
        System.out.println("TRUE cases:  ");
        System.out.println(rem("aa", "a*"));
        System.out.println(rem("aa", ".*"));
        System.out.println(rem("aabb", "a.*b"));
        System.out.println(rem("aabbbbbb", "a.*b"));
        System.out.println(rem("accabbbbbffb", "a.*b"));
        System.out.println(rem("acb", "a.b"));
        System.out.println();

        System.out.println("FALSE cases: ");
        System.out.println(rem("aa", "a"));
        System.out.println(rem("a", "aa"));
        System.out.println(rem("aabb", "a.*bc"));
        System.out.println(rem("aabbc", "a.*b"));
        System.out.println(rem("aabbbbbbc", "a.*b"));
        System.out.println(rem("saabbbbbb", "a.*b"));
        System.out.println(rem("accabbbbbffbcd", "a.*bc"));
        System.out.println(rem("a.b", "acbc"));
    }

}

解题思路：

构造boolean dp数组，数组[i][j]的含义为长度为 i 的patter子串， 与长度为 j 的输入子串，是否相匹配

1. dp[0][0] = true 。 即长度为0的pattern和长度为0的输入子串相匹配。 后面要用到

2. i>0 && j>0时， dp[i][j] = dp[i-1][j-1] && 当前位置匹配,分为以下情况：

1. p[i] == '.'， 那么对任意 s[j] ， 均匹配

2. p[i] == '*', 分2种情况：

1. p[i-1] == '.'， 那么对于后续任意位置的s[j...s.length]，均匹配

2. p[i-1] != '.', 那么对于后续连续位置的 s[j] == p[i-1]， 均匹配

3. p[i] != '.' && p[i] != '*', p[i] == s[i]时匹配