标签：
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
1 bool isMatch(const char *s, const char *p) 2 { 3 if (*p == ‘\0‘) 4 return (*s == ‘\0‘); 5 6 if (*(p+1) == ‘*‘) 7 { 8 while(*p == *s || (*p == ‘.‘ && *s != ‘\0‘)) 9 { 10 if (isMatch(s++, p+2)) 11 return true; 12 } 13 return isMatch(s, p+2); 14 } 15 else 16 { 17 if (*p == *s || (*p == ‘.‘ && *s != ‘\0‘)) 18 return isMatch(s+1, p+1); 19 return false; 20 } 21 }
leetcode 10. Regular Expression Matching
标签：
原文地址：http://www.cnblogs.com/ym65536/p/4221878.html
