Leetcode 10 Regular Expression Matching

Given an input string (s) and a pattern (p), 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).

Note:

• s could be empty and contains only lowercase letters a-z.
• p could be empty and contains only lowercase letters a-z, and characters like . or *.

Example 1:

Input:
s = "aa"
p = "a"
Output: false
Explanation: "a" does not match the entire string "aa".

Example 2:

Input:
s = "aa"
p = "a*"
Output: true
Explanation: '*' means zero or more of the precedeng element, 'a'. Therefore, by repeating 'a' once, it becomes "aa".

Example 3:

Input:
s = "ab"
p = ".*"
Output: true
Explanation: ".*" means "zero or more (*) of any character (.)".

Example 4:

Input:
s = "aab"
p = "c*a*b"
Output: true
Explanation: c can be repeated 0 times, a can be repeated 1 time. Therefore it matches "aab".

Example 5:

Input:
s = "mississippi"
p = "mis*is*p*."
Output: false

这个题的题意与剑指Offer中一个题目类似，均为模拟一个正则表达式的匹配过程，即为字符串的匹配问题，这类问题使用dp可以解决。

class Solution {
    public boolean isMatch(String s, String p) {
        //数组标识的为元素的实际位置
        boolean[][] dp = new boolean[s.length() + 1][p.length() + 1];
        dp[0][0] = true;
        //判断“a”和“a*”match的情况
        for(int i = 1 ; i <= p.length() ;i++){
            if(p.charAt(i - 1) == '*' && dp[0][i - 2]){
                dp[0][i] = true;
            }
        }
        for(int i = 1 ; i <= s.length();i++){
            for(int j = 1 ; j <= p.length();j++){
                //单个字符匹配的情况
                if(s.charAt(i - 1) == p.charAt(j - 1) || p.charAt(j - 1) == '.'){
                    dp[i][j] = dp[i - 1][j - 1];
                }else if(p.charAt(j - 1) == '*'){//字符未匹配，使用*来进行填补
                    //当字符没有匹配而且也没有“.”的情况
                    if(p.charAt(j - 2) != s.charAt(i - 1) && p.charAt(j - 2) != '.'){
                        dp[i][j] = dp[i][j - 2];
                    }else{
                        //可以进行匹配的三个条件
                        dp[i][j] = (dp[i][j - 2] || dp[i][j - 1] || dp[i - 1][j]);
                    }
                }
            }
        }
        //返回最后dp的值，如果一路匹配下来则为true，但是如果在其中任何一个点断了就为false
        return dp[s.length()][p.length()];
    }
}

接下来为奇招：

class Solution {
    public boolean isMatch(String s, String p) {
        return s.matches(p);   
    }
}

直接套用Regex的库函数进行判断。

推荐：正则表达式

           B站视频