Regular Expression Matching

CodeAsWind

于 2014-07-24 13:29:44 发布

阅读量494

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/CodeAsWind/article/details/38083071

版权

LeetCode 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

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

解题思路：

如果p[i+1]!='*',s[j]==p[i]则进行下一位的匹配（i+1,j+1）,如果s[j]!=p[i],则匹配失败！

如果p[i+1]==‘*',s[j]==p[i]则匹配下一位（j+1,i+2）和（j,i+2）,若s[j]!=p[i],则匹配（j,i+2）!

Code:

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

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