leetcode10

def isMatch(s, p): m,n = len(s),len(p) dp = [[False for i in range(m+1)] for j in range(n+1)] dp[0][0] = True for i in range(0,n): for j in range(1,m): if s[j] == p

>>阅读原文<<