LeetCode題解(Offer19)：正規表示式匹配的*和.實現(Python)

題目：原題連結（困難）

標籤：字串、動態規劃、動態規劃-狀態表格

解法	時間複雜度	空間複雜度	執行用時
Ans 1 (Python)	$O(M\times N)$	$O(M\times N)$	64ms (74.22%)
Ans 2 (Python)
Ans 3 (Python)

解法一（動態規劃）：

class Solution:
    def isMatch(self, s: str, p: str) -> bool:
        N1 = len(s)
        N2 = len(p)

        matrix = [[False] * (N2 + 1) for _ in range(N1 + 1)]
        matrix[0][0] = True

        for i in range(N1 + 1):
            for j in range(1, N2 + 1):
                if p[j - 1] == "*":
                    matrix[i][j] |= matrix[i][j - 2]
                    # print((i, j - 2), "->", (i, j))
                    if i > 0 and (p[j - 2] == "." or s[i - 1] == p[j - 2]):
                        matrix[i][j] |= matrix[i - 1][j]
                        # print((i - 1, j), "->", (i, j))
                elif i > 0 and (p[j - 1] == "." or s[i - 1] == p[j - 1]):
                    matrix[i][j] |= matrix[i - 1][j - 1]
                    # print((i - 1, j - 1), "->", (i, j))

        return matrix[N1][N2]