10. Regular Expression Matching

Given an input string (s) and a pattern §, 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 = “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

class Solution:
    def __init__(self):
        self.temp={}
    def isMatch(self, s: str, p: str) -> bool:
        
        if len(p)==0:
            if len(s)!=0:
                return False
            else:
                return True
        he=s+'+'+p
        if he in self.temp:
            return self.temp[he]
        firstMatch = len(s) > 0 and (p[0] == s[0] or p[0] == '.')
        if len(p) > 1 and p[1] == '*':
            if firstMatch:
                res = self.isMatch(s[1:], p) or self.isMatch(s, p[2:])
            else:
                res = self.isMatch(s, p[2:])
        else:
            res = firstMatch and self.isMatch(s[1:], p[1:])
        self.temp[he]=res
        return res

这个主要用到了递归
先判断为空的情况，

        firstMatch = len(s) > 0 and (p[0] == s[0] or p[0] == '.')

判断出现.的情况

		if len(p) > 1 and p[1] == '*':
           	if firstMatch:
            	res = self.isMatch(s[1:], p) or self.isMatch(s, p[2:])
        	else:
                res = self.isMatch(s, p[2:])

判断出现*的情况