Wildcard Matching

最新推荐文章于 2021-04-13 10:34:38 发布

原创最新推荐文章于 2021-04-13 10:34:38 发布 · 584 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#贪心

LeetCode 专栏收录该内容

113 篇文章

订阅专栏

本文详细介绍了如何实现一个通配符匹配算法，支持‘？’匹配任意单个字符和‘*’匹配任意字符序列。通过一系列示例展示算法的应用，包括匹配空字符串、单字符、重复字符序列等场景。

Implement wildcard pattern matching with support for '?' and '*'.

'?' Matches any single character.
'*' Matches any sequence of characters (including the empty sequence).

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", "*") → true
isMatch("aa", "a*") → true
isMatch("ab", "?*") → true
isMatch("aab", "c*a*b") → false

 bool isMatch(const char *s, const char *p) {
	
	const char* start = NULL;
	const char* scomp = NULL;
	while (*s!='\0')
	{
		if (*s==*p||*p=='?'){
			p++;
			s++;
			continue;
		}
		if (*p=='*'){
			start = p;
			scomp = s;
			p++;
			continue;

		}
		if (start!=NULL){
			p = start + 1;
			s = scomp + 1;
			scomp++;
			continue;
		}
		return false;
	}
	while (*p == '*')
		++p;
	return *p == '\0';
}