leetcode---wildcard-matching---字符串,dp
来源:互联网 发布:无人机模拟器软件 编辑:程序博客网 时间:2024/05/16 01:05
Implement wildcard pattern matching with support for’?’and’*’.
‘?’ Matches any single character.
‘*’ Matches any sequence of characters (including the empty sequence).
The matching should cover the entire input string (not partial).
The function prototype should be:
bool isMatch(const char *s, const char *p)
Some examples:
isMatch(“aa”,”a”) → false
isMatch(“aa”,”aa”) → true
isMatch(“aaa”,”aa”) → false
isMatch(“aa”, “*”) → true
isMatch(“aa”, “a*”) → true
isMatch(“ab”, “?*”) → true
isMatch(“aab”, “c*a*b”) → false
class Solution {public: bool isMatch(const char *s, const char *p) { int nS = strlen(s); int nP = strlen(p); vector< vector<bool> > dp(nS+1, vector<bool>(nP+1, false)); dp[0][0] = true; for(int i=1; i<=nP; i++) { dp[0][i] = dp[0][i-1] && p[i-1] == '*'; } for(int i=1; i<=nS; i++) { for(int j=1; j<=nP; j++) { if(s[i-1] == p[j-1] || p[j-1] == '?') dp[i][j] = dp[i-1][j-1]; else if(p[j-1] == '*') dp[i][j] = dp[i-1][j] || dp[i][j-1]; } } return dp[nS][nP]; }};
阅读全文
0 0
- leetcode---wildcard-matching---字符串,dp
- LeetCode Wildcard Matching DP/贪心
- LeetCode-44-Wildcard Matching DP
- [leetcode[ 【字符串】 44. Wildcard Matching
- Wildcard Matching[leetcode]直接匹配和DP
- Leetcode Wildcard Matching 字符串*?模式匹配
- LeetCode: Wildcard Matching
- LeetCode : Wildcard Matching
- [LeetCode] Wildcard Matching - Iteratively
- leetcode 83: Wildcard Matching
- [Leetcode] Wildcard Matching
- [LeetCode]Wildcard Matching
- LeetCode-Wildcard Matching
- LeetCode -- Wildcard Matching
- LeetCode | Wildcard Matching
- Leetcode: Wildcard Matching
- Leetcode:Wildcard Matching
- LeetCode题解:Wildcard Matching
- leetcode 第七题:Reverse Integer
- LeetCode目录。
- Git基础教程
- 回调函数(CallBack)
- 数据分析之《菜鸟侦探挑战数据分析》-3-R语言-散点图,相关系数,回归线
- leetcode---wildcard-matching---字符串,dp
- Node gs
- strtok与位运算
- windows 启动kafka
- andriod——订单查询
- 通过SP_Flash_Tool线刷失败解决方法
- 在loadrunner下获取header头信息
- Swift4
- F_A day2