Regular Expression Matching

Nereus_Li

于 2015-04-01 13:49:44 发布

阅读量574

点赞数

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

本文链接：https://blog.csdn.net/li_chihang/article/details/44805923

版权

LeetCode 专栏收录该内容

113 篇文章 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

#include<iostream>
#include<vector>
#include<string>
using namespace std;

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