10. Regular Expression Matching
提交网址： https://leetcode.com/problems/regular-expression-matching/
Total Accepted: 79548 Total
Submissions: 361279 Difficulty: Hard
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
分析：
(待解决)LeetCode 10. Regular Expression Matching 解题报告
原文：http://blog.csdn.net/lzuacm/article/details/51336159