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

例如：

abed
?b*d**

a=?, go on, b=b, go on,
e=*, save * position star=3, save s position match = 3, p++
e!=d,  check if there was a *, yes, s=++match; p=star+1
d=d, go on, meet the end.
check the rest element in p, if all are *, true, else false;

 

C++代码比较简洁，java代码就麻烦点了。

public boolean isMatch(String s, String p) {
    int i = 0, j = 0;
    int m = s.length(), n = p.length();
    int star = -1, match = 0;
    while(i<m) {
        if(j < n && (p.charAt(j) == '?' || p.charAt(j) == s.charAt(i))) {
            i++;j++;
        } else if(j<n && p.charAt(j) == '*') {
            star = j++;
            match = i;
        } else if(star != -1){
            j = star + 1;
            i = ++match;
        } else {
            return false;
        }
    }
    
    while(j<n && p.charAt(j) == '*') {
        j++;
    }
    return j == n;
}

 

bool isMatch(const char *s, const char *p) {
    const char* star=NULL;
    const char* ss=s; 
    while (*s){
        if ((*p=='?')||(*p==*s)){s++;p++;continue;}
        if (*p=='*'){star=p++; ss=s;continue;}
        if (star){ p = star+1; s=++ss;continue;}
        return false;
    }
    while (*p=='*'){p++;}
    return !*p;
}