[LeetCode]Regular Expression Matching

最新推荐文章于 2020-08-22 11:30:56 发布

Jet_yingjia

最新推荐文章于 2020-08-22 11:30:56 发布

阅读量764

点赞数 1

分类专栏： LeetCode 文章标签：正则表达式

本文链接：https://blog.csdn.net/Jet_yingjia/article/details/25798313

版权

LeetCode 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

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 == 0) 
	{
		return *s == 0;
	}
	//不等于'*'的情况
	if(*(p + 1) != '*')
	{
		//若此时*s和*p相等，则进行isMatch(s+1, p+1)的判断
		if(*s && (*s == *p || *p == '.'))
		{
			return isMatch(s + 1, p + 1);
		}
		return false;
	}
	else
	{
		for(; *s && (*s == *p || *p == '.'); s++)
		{
			//'*' 不再匹配前面的字符.
			if(isMatch(s, p + 2))
			{
				return true;   
			}
		    //'*'接着匹配前面的字符.继续for循环
		}
		//'*'匹配结束
		return isMatch(s, p + 2);	
	}
        
    }
};