代码拉取完成,页面将自动刷新
/**
* Question Link: https://leetcode.com/problems/wildcard-matching/
* Primary idea: Classic Two Dimensionel Dynamic Programming
* Time Complexity: O(mn), Space Complexity: O(mn)
*/
class WildcardMatching {
func isMatch(_ s: String, _ p: String) -> Bool {
let sChars = Array(s), pChars = Array(p)
var dp = Array(repeating: Array(repeating: false, count: p.count + 1), count: s.count + 1)
dp[0][0] = true
// must start from 0, to make range feasible and handle empty vs. * case
for i in 0...s.count {
for j in 0...p.count {
guard j > 0 else {
continue
}
let pCurrent = pChars[j - 1]
if pCurrent != "*" {
dp[i][j] = i > 0 && dp[i - 1][j - 1] && (pCurrent == sChars[i - 1] || pCurrent == "?")
} else {
// Two situations:
// (1) '*' is the first character in p;
// (2) For k>=0 and k<=i, there is some dp[k][j-1] being true;
// and '*' will match the rest sequence in s after index k;
var flag = false
for k in 0...i {
if dp[k][j - 1] {
flag = true
break
}
}
dp[i][j] = flag || j == 1
}
}
}
return dp[s.count][p.count]
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。