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 看了一份C++的代码bool isMatch(const char *s, const char *p) { const char* star=NULL; const char* ss=s; while (*s){ //advancing both pointers when (both characters match) or ('?' found in pattern) //note that *p will not advance beyond its length if ((*p=='?')||(*p==*s)){s++;p++;continue;} // * found in pattern, track index of *, only advancing pattern pointer if (*p=='*'){star=p++; ss=s;continue;} //current characters didn't match, last pattern pointer was *, current pattern pointer is not * //only advancing pattern pointer if (star){ p = star+1; s=++ss;continue;} //current pattern pointer is not star, last patter pointer was not * //characters do not match return false; } //check for remaining characters in pattern while (*p=='*'){p++;} return !*p; }
在此基础上改写的Java版本public class Solution { public boolean isMatch(String s, String p){ int ss=0,pp=0,match=0; int start=-1; while(ss<s.length()){ if(pp<p.length()&&(p.charAt(pp)=='?'||p.charAt(pp)==s.charAt(ss))){pp++;ss++;} else if(pp<p.length()&&p.charAt(pp)=='*') { start=pp++; // ss++; match=ss; } else if(start!=-1) { pp=start+1; ss=match; match++; } else return false; } while(pp<p.length()&&p.charAt(pp)=='*') pp++; return pp==p.length(); } }
不过好像没有考虑s中也有*/?的情况
参考:http://xoomer.virgilio.it/acantato/dev/wildcard/wildmatch.html#A_first_algorithm
https://leetcode.com/discuss/10133/linear-runtime-and-constant-space-solution