Google+ Followers

Sunday, April 7, 2013

[LeetCode] Regular Expression Matching, Solution


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
» Solve this problem

[Thoughts]
与Wildcard Maching同一题。
http://fisherlei.blogspot.com/2013/01/leetcode-wildcard-matching.html




Post a Comment