algo 1

dynamic programming + one dim vector

dp: dp[i][j] whether $p^{'}$ with length j match current substring of ${s^{'}}$ of length i

the transformation equations follows as:

p[j-1] != '*' dp[i-1][j-1] && (s[i - 1] == dp[j - 1] || dp[j - 1] == ? )

p[j-1] == '*' dp[i][j - 1] || dp[i - 1][j]

44. Wildcard Matching
Description Implement wildcard pattern matching with supp...
📚 44. Wildcard Matching
LeetCode里面两个expression matching问题都是各家面试的重点和 44.找出recursi...
44. Wildcard Matching
题目 Implement wildcard pattern matching with support for '...
44. Wildcard Matching
问题 Implement wildcard pattern matching with support for '...
44. Wildcard Matching
algo 1 dynamic programming + one dim vector dp: dp[i][j] ...
44. Wildcard Matching
非常好的分析动态规划的方法
leetcode 44. Wildcard Matching
目录题目贪心方法参考 1. 题目 2. 贪心方法 2.1 思想与DP解决方案相比，它检查更少的状态，可以更...
[DFS]44. Wildcard Matching
分类：DFS/DP 时间复杂度: O(m*n) （两种解法都是这个时间复杂度） 44. Wildcard Matc...
[Leetcode] 42. Wildcard Matching
题目 Implement wildcard pattern matching with support for '...
192. Wildcard Matching
Description Implement wildcard pattern matching with supp...