面试题

1-天眼查：

class Solution:
    def isMatch(self, s: str, p: str) -> bool:
        m, n = len(s), len(p)
		#二维布尔数组 dp，其中 dp[i][j] 表示字符串 s 的前 i 个字符是否能和模式 p 的前 j 个字符匹配。
        dp = [[False] * (n + 1) for _ in range(m + 1)]
        
        dp[0][0] = True # 表示空字符串和空模式匹配，显然 dp[0][0] = True
        
        # Fill in dp table
        for j in range(1, n + 1):
            if p[j - 1] == '*':
                dp[0][j] = dp[0][j - 1]
        
        for i in range(1, m + 1):
            for j in range(1, n + 1):
                if p[j - 1] == '*':
                    dp[i][j] = dp[i][j - 1] or dp[i - 1][j]
                elif p[j - 1] == '?' or p[j - 1] == s[i - 1]:
                    dp[i][j] = dp[i - 1][j - 1]
        
        return dp[m][n]

# Self-test
def run():
    solution = Solution()
    result = solution.isMatch("ab", "*")
    print(result)  # Expected output: True

run()