44. 通配符匹配

44. 通配符匹配

for (var k = 1; k <= n; k++) { 边界处理

for (var i = 1; i <= m; i++) { 二位数组外层循环

for (var j = 1; j <= n; j++) {二位数组内层循环

if (s1[i - 1] == s2[j - 1] || s2[j - 1] == '?') { 那么 此处的布尔型取决于 上一行 和 上一列的值

else if (s2[j - 1] == '*') {遇到*，则对应的那一列的值都为true

var isMatch = function (s1, s2) {
    var m = s1.length, n = s2.length
    var dp = new Array(m + 1).fill(false).map(() => new Array(n + 1).fill(false))
    dp[0][0] = true
    for (var k = 1; k <= n; k++) {
        if (dp[0][k - 1] && s2[k - 1] == '*') {
            dp[0][k] = true
        }
    }
    for (var i = 1; i <= m; i++) {
        for (var j = 1; j <= n; j++) {
            if (s1[i - 1] == s2[j - 1] || s2[j - 1] == '?') {
                dp[i][j] = dp[i - 1][j - 1]
            } else if (s2[j - 1] == '*') {
                dp[i][j] = dp[i][j - 1] || dp[i - 1][j]
            }
        }
    }
    return dp[m][n]
};