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

思路：

开始没理解题意，这里的 '*'可以看成是前一个字母的计数， 0个，1个，多个。如果为 0 个，就相当于 '*'和其前一个字母不存在。

参考：  http://leetcode.com/2011/09/regular-expression-matching.html

参考代码：

class Solution {
public:
	bool isMatch(const char *s, const char *p) {
		assert(s && p);
		if (*p == '\0')
			return *s == '\0';

		if (*(p + 1) != '*') {
			assert(*p != '*');
			return ((*p == *s) || (*p == '.' && *s != '\0')) && isMatch(s + 1, p + 1);
		}

		while ((*p == *s) || (*p == '.' && *s != '\0')) {
			if (isMatch(s, p + 2)) 
				return true;
			s++;
		}
		return isMatch(s, p + 2);
	}
};