10. Regular Expression Matching

Source: https://leetcode.com/problems/regular-expression-matching/
Time: 2020/12/18

Description
Given an input string (s) and a pattern §, implement regular expression matching with support for ‘.’ and ‘*’ where:

‘.’ Matches any single character.​​​​
‘*’ Matches zero or more of the preceding element.
The matching should cover the entire input string (not partial).

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 preceding 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 = “cab”
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 = “misisp*.”
Output: false

Constraints:

0 <= s.length <= 20
0 <= p.length <= 30
s contains only lowercase English letters.
p contains only lowercase English letters, ‘.’, and ‘’.
It is guaranteed for each appearance of the character '’, there will be a previous valid character to match.

Solution
Approach1: Recursion
这个递归的总思想还是把问题化成一个个小问题，所以后面还有dp解法

tip：发现的不常注意的语法问题，&& 这个运算符前面表达式只要判定为false就不会执行后一个表达式，所以在line9，两个要是调换顺序，就会又runtime error

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

Approach 2: Dynamic Programming

挖个坑留着吧，真的有点太难了