面试题32：字符串的通配符匹配

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) {
        int i = 0, j = 0;
        int pstar = -1;
        int sstar = -1;
        while (s[i] != '') {
            if (p[j] == '?' || s[i] == p[j]) {
                i++;
                j++;
            } else if (p[j] == '*') {
                pstar = j;
                sstar = i;
                j++;
            } else {
                if (pstar != -1) {
                    j = pstar + 1;
                    sstar++;
                    i = sstar;
                } else {
                    return false;
                }
            }
        }

        while (p[j] == '*') {
            j++;
        }
        return p[j] == '';

    }
};