LeetCode-10 Regular Expression Matching

Description

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

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 = “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

Submissions

首先这道题的主要难点在于如何处理匹配多少次问题,所以尝试递归解法,我们首先判断len( p)>1 and p[1]==" * ",如果是说明 * 在p的第二位,我们就判断s[0]和p[0]能否匹配,如果可以匹配,我们继续判断isMatch(s[1:], p)（也就是 * 匹配了一次,我们会继续使用. * 或者? * 去参与比较）,同时需要判断isMatch(s,p[2:])是否成立.如果上述条件不成立,我们还需判断isMatch(s,p[2:])是否成立,因为此时也可能匹配0次.如果*不在p的第二位，我们就要判断s[0]和p[0]是否匹配。
实现代码如下:

class Solution:
    def isMatch(self, s: str, p: str) -> bool:
        s_len = len(s)
        p_len = len(p)
        if p_len == 0:
            return s_len == 0
        if p_len > 1 and p[1] == "*":
            if s_len != 0 and (s[0] == p[0] or p[0] == '.'):
                return self.isMatch(s[1:], p) or self.isMatch(s, p[2:])
            else:
    	        return self.isMatch(s, p[2:])
        else:
            return s_len != 0 and (s[0] == p[0] or p[0] == '.') and self.isMatch(s[1:], p[1:])

参考:https://blog.csdn.net/qq_17550379/article/details/84110005

而经过查询资料发现直接利用Python正则库更简单.
实现代码如下:

class Solution:
    def isMatch(self, s: str, p: str) -> bool:
        return re.match('^'+p+'$',s)!=None

参考:https://blog.csdn.net/zysps1/article/details/88359997