LeetCode 10： 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

代码如下

class Solution {
public:
    bool isMatch(const char *s,const char *p) {
     	if(*p == '')
		return *s == '';
	if(*(p+1) != '*'){
		if((*p==*s) || ((*p=='.') && (*s!='')))
                         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;
    }
};

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!