首页 > 代码库 > [LeetCode]Regular Expression Matching
[LeetCode]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") → 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
刚开始想错了,没做对,参考网上程序写的:
class Solution { public: bool isMatch(const char *s, const char *p) { if(*p == 0) { return *s == 0; } //不等于‘*‘的情况 if(*(p + 1) != ‘*‘) { //若此时*s和*p相等,则进行isMatch(s+1, p+1)的判断 if(*s && (*s == *p || *p == ‘.‘)) { return isMatch(s + 1, p + 1); } return false; } else { for(; *s && (*s == *p || *p == ‘.‘); s++) { //‘*‘ 不再匹配前面的字符. if(isMatch(s, p + 2)) { return true; } //‘*‘接着匹配前面的字符.继续for循环 } //‘*‘匹配结束 return isMatch(s, p + 2); } } };
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。