LeetCode 44：Wildcard Matching

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

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

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;


    }
};

LeetCode 44：Wildcard Matching

原文：http://blog.csdn.net/sunao2002002/article/details/46352971