问一道LeeCode题目: regular expression matching# JobHunting - 待字闺中
H*l
1 楼
题目在下面。
两个test case看起来是互相矛盾的，搞不清楚规则：
input expected
"ab", ".*c" false
input expected
"ab", ".*" true
我觉得这两个都应该是true才对啊。。。
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
两个test case看起来是互相矛盾的，搞不清楚规则：
input expected
"ab", ".*c" false
input expected
"ab", ".*" true
我觉得这两个都应该是true才对啊。。。
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
