原题链接:https://leetcode.cn/problems/zheng-ze-biao-da-shi-pi-pei-lcof/
func isMatch(s string, p string) bool {
len_s, len_p := len(s), len(p)
dp := make([][]bool, len_p+1)
for i := 0; i <= len_p; i++ {
dp[i] = make([]bool, len_s+1)
}
dp[0][0] = true
for i := 1; i <= len_p; i++ {
idx_p := i - 1
if p[idx_p] == '*' && i >= 2 {
dp[i][0] = dp[i-2][0]
}
}
for i := 1; i <= len_p; i++ {
for j := 1; j <= len_s; j++ {
idx_p := i - 1
idx_s := j - 1
if p[idx_p] == '.' {
dp[i][j] = dp[i-1][j-1]
} else if p[idx_p] == '*' {
dp[i][j] = dp[i-2][j] || dp[i-1][j] || (dp[i][j-1] && (p[idx_p-1] == s[idx_s] || p[idx_p-1] == '.'))
} else {
dp[i][j] = dp[i-1][j-1] && (p[idx_p] == s[idx_s])
}
}
}
return dp[len_p][len_s]
}