LeetCode--Regular Expression Matching
来源:互联网 发布:云计算开发语言 编辑:程序博客网 时间:2024/06/03 21:26
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”) ? false
isMatch(“aa”,”aa”) ? true
isMatch(“aaa”,”aa”) ? false
isMatch(“aa”, “a*”) ? true
isMatch(“aa”, “.*”) ? true
isMatch(“ab”, “.*”) ? true
isMatch(“aab”, “c*a*b”) ? true
方法一:动态规划。
如果s[0..i]和p[0..j]匹配,则状态dp[i][j]为ture,反之为false。状态方程如下:
dp[i][j] = dp[i - 1][j - 1], if p[j - 1] != ‘*’ && (s[i - 1] == p[j - 1] || p[j - 1] == ‘.’);
dp[i][j] = dp[i][j - 2], if p[j - 1] == ‘*’ ;(字符出现0次)
dp[i][j] = dp[i - 1][j] && (s[i - 1] == p[j - 2] || p[j - 2] == ‘.’), if p[j - 1] == ‘*’ (字符出现至少一次)
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]; }};
方法二:递归法。
按照下一个字符是否为’*’的两种情况进行讨论,分别递归求解,但是耗时较长,推荐使用动态规划,可以用空间换时间。
class Solution {public: bool isMatch(string s, string p) { return isMatch(s.c_str(),p.c_str()); }private: bool isMatch(const char*s,const char*p) { if(*p=='\0') return *s=='\0'; if(*(p+1)!='*') { if(*p==*s||(*p=='.'&&*s!='\0')) return isMatch(s+1,p+1); else return false; } else { while(*p==*s||(*p=='.'&&*s!='\0')) { if(isMatch(s,p+2)) return true; s++; } return isMatch(s,p+2); } }};
- LeetCode: Regular Expression Matching
- LeetCode: Regular Expression Matching
- leetcode Regular Expression Matching
- [Leetcode] Regular Expression Matching
- [LeetCode]Regular Expression Matching
- LeetCode-Regular Expression Matching
- Regular Expression Matching LeetCode
- LeetCode | Regular Expression Matching
- LeetCode: Regular Expression Matching
- Leetcode: Regular Expression Matching
- [LeetCode] Regular Expression matching
- [LeetCode] Regular Expression Matching
- LeetCode Regular Expression Matching
- leetcode Regular Expression Matching
- leetcode: Regular Expression Matching
- LeetCode Regular Expression Matching
- Leetcode: Regular Expression Matching
- leetcode:Regular Expression Matching
- CentOS 官网下载及版本说明
- 关于eclipse的mysql连接配置
- 【CJOJ1372】【洛谷2730】【USACO 3.2.5】魔板
- C/C++学习之basic_string
- 插入排序-算法
- LeetCode--Regular Expression Matching
- NP-complete problems课后题
- rpm 安装软件
- 从Hermite插值公式推导Smoothstep插值公式
- PAT b1046-b1049题解
- 【网络】URG 和 PSH 标志位
- Js(四)随笔(个人观看)
- Nginx负载均衡NFS配置
- C++ sizeof操作符