Regular Expression Matching
2015-04-01 13:49
204 查看
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
#include<iostream> #include<vector> #include<string> using namespace std; bool isMatch(const char *s, const char *p) { if (*p=='\0') return *s=='\0'; if (*(p+1)=='*') { while (*s==*p||(*s != '\0' && *p == '.')) { if (isMatch(s, p+2)) return true; else s++; } return isMatch(s, p+2); } else if(*s==*p||(*s != '\0' && *p == '.')) return isMatch(s+1, p+1); else return false; }
相关文章推荐
- LeetCode_10 Regular Expression Matching
- leetcode(10) - Regular Expression Matching 正则表达式匹配
- Regular Expression Matching
- LeetCode——Regular Expression Matching
- [LeetCode] 079: Regular Expression Matching
- 正则表达式匹配-leetcode Regular Expression Matching
- regular expression matching --python
- [DP] LeetCode Regular Expression Matching
- [LeetCode] Regular Expression Matching - Recursively
- LeetCode 10. Regular Expression Matching
- LeetCode_Regular Expression Matching
- 多正则表达式匹配 (Multiple Regular Expression Matching) 中的动态 DFA 算法
- Regular Expression Matching
- Regular Expression Matching
- [LeetCode] Regular Expression Matching [6]
- leetcode: Regular Expression Matching
- Regular Expression Matching
- LeetCode 142 Regular Expression Matching
- leetcode Regular Expression Matching
- Regular Expression Matching -- leetcode