10. Regular Expression Matching(很重要!!!)
来源:互联网 发布:javascript用什么打开 编辑:程序博客网 时间:2024/06/14 09:59
10. Regular Expression Matching
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
Subscribe to see which companies asked this question
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.
class Solution {public:bool isMatch(string s, string p) {int m = s.size(), n = p.size();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 && dp[i - 1][j] && (s[i - 1] == p[j - 2] || p[j - 2] == '.'));}else{if (i > 0 && (s[i-1] == p[j-1] || p[j-1] == '.')){dp[i][j] = dp[i - 1][j - 1];}}}}return dp[m][n];}};
44. Wildcard Matching
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") → falseisMatch("aa","aa") → trueisMatch("aaa","aa") → falseisMatch("aa", "*") → trueisMatch("aa", "a*") → trueisMatch("ab", "?*") → trueisMatch("aab", "c*a*b") → false
Subscribe to see which companies asked this question
这个跟上面的区别是,这里*是通配符可以匹配任何字符,而不是它前面的那个字符。
class Solution {public:bool isMatch(string s, string p) {int m = s.size(), n = p.size();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 - 1] || (i > 0 && dp[i - 1][j]);//}else{if (i > 0 && (s[i - 1] == p[j - 1] || p[j - 1] == '?')){dp[i][j] = dp[i - 1][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
- Snapdragon浅析
- iOS_画一像素的线
- iOS原生态删除、置顶某行cell
- 一些面试题收集
- centos下为laravel框架配置nginx服务器虚拟主机
- 10. Regular Expression Matching(很重要!!!)
- UVA 10200
- 超实用压力测试工具-ab工具
- STM32中控制I/O口的寄存器们
- 代码的自动生成与编译(一)
- Apache ActiveMQ启动DEMO错误
- 【C语言】文件指针与文件位置指针,位置指针相关操作库函数
- java海量数据导出xls分页解决报内存溢出问题
- 如何在SQL Server实现类似RowNum伪列