10. Regular Expression Matching
来源:互联网 发布:淘宝龙瞎皮肤多少钱 编辑:程序博客网 时间:2024/06/06 14:25
Implement regular expression matching with support for '.'
and '*'
.
'.' Matches any single character.'*' Matches zero or more of the preceding element.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") → falseisMatch("aa","aa") → trueisMatch("aaa","aa") → falseisMatch("aa", "a*") → trueisMatch("aa", ".*") → trueisMatch("ab", ".*") → trueisMatch("aab", "c*a*b") → true
这个题目参考DISCUSS中的解法,动态规划,主要难在各个状态的分析
小tips:对于字符串匹配的解法都是类似的,涉及字符串 动态规划数组的大小一般都是size+1 因为0表示空字符串
本题中i从0开始,j从1开始,因为题意是p中存在可以匹配s的,所以当s为0(空字符串)时,p存在1个(*)即可匹配
9-lines 16ms C++ DP Solutions with Explanations
This problem has a typical solution using Dynamic Programming. We define the state P[i][j]
to be true
if s[0..i)
matches p[0..j)
and false
otherwise. Then the state equations are:
P[i][j] = P[i - 1][j - 1]
, ifp[j - 1] != '*' && (s[i - 1] == p[j - 1] || p[j - 1] == '.')
;P[i][j] = P[i][j - 2]
, ifp[j - 1] == '*'
and the pattern repeats for0
times;P[i][j] = P[i - 1][j] && (s[i - 1] == p[j - 2] || p[j - 2] == '.')
, ifp[j - 1] == '*'
and the pattern repeats for at least1
times.
Putting these together, we will have the following code.
class Solution {public: bool isMatch(string s, string p) { int m = s.length(), n = p.length(); vector<vector<bool> > dp(m + 1, vector<bool> (n + 1, false)); dp[0][0] = true; for (int i = 0; i <= m; i++) for (int j = 1; j <= n; j++) if (p[j - 1] == '*') dp[i][j] = dp[i][j - 2] || (i > 0 && (s[i - 1] == p[j - 2] || p[j - 2] == '.') && dp[i - 1][j]); else dp[i][j] = i > 0 && dp[i - 1][j - 1] && (s[i - 1] == p[j - 1] || p[j - 1] == '.'); return dp[m][n]; }};
阅读全文
0 0
- 10. Regular Expression Matching
- 10.Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 10. Regular Expression Matching
- 2017年第18届立嘉国际机械展览会会刊(参展商名录)
- 区间dp||记忆化搜索 Game of Sum UVA
- 扫描分析代码漏洞的强大工具
- vue.js使用axios实现跨域请求
- 复合主键与联合主键
- 10. Regular Expression Matching
- 超实平面上函数的微分定义
- kafka配置文件详细
- Ubuntu 搭建Ghost1.0博客系统
- 金蝶K3录单时物料的仓库和默认仓库不一致给予提示,取消该提示框
- 什么是PATHINFO
- java.lang.RuntimeException: Can't create handler inside thread that has not called Looper.prepare()
- UML中的类图关系——依赖
- 1014. 福尔摩斯的约会 (20) PAT乙级真题