本文共 882 字，大约阅读时间需要 2 分钟。

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") → falseisMatch("aa","aa") → trueisMatch("aaa","aa") → falseisMatch("aa", "a*") → trueisMatch("aa", ".*") → trueisMatch("ab", ".*") → trueisMatch("aab", "c*a*b") → true

代码如下

class Solution {public:    bool isMatch(const char *s, const char *p) {     	if(*p == '\0')		return *s == '\0';	if(*(p+1) != '*'){		if((*p==*s) || ((*p=='.') && (*s!='\0')))                          return isMatch(s+1, p+1);		else 			return false;	}else{		while(*s && (*s==*p || *p=='.'))		{			if(isMatch(s, p+2))				return true;			s++;		}		return isMatch(s, p+2);	}	return false;    }};

转载地址：http://cbxti.baihongyu.com/