本文共 972 字，大约阅读时间需要 3 分钟。

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

题目要求实现模糊匹配，代码如下：

class Solution {public:    bool isMatch(const char *s, const char *p) {    	bool isStar = false;		const char* s1, *p1;		while(*s && (*p || isStar)){			if((*s==*p) || (*p=='?')){				s++; p++;			}else if(*p == '*'){				isStar = true;				p++;				if(*p=='\0') return true;				s1 = s;				p1 = p;			}else{				if(!isStar) return false;				p =p1;				s = ++s1;			}		}		if(*s=='\0'){			while(*p=='*')p++;			if(*p=='\0') return true;		}		return false;    }};

转载地址：http://tbxti.baihongyu.com/