Leetcode 44 Wildcard Matching 推荐

'?' 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(string s, string p) {
        int ss=0,ps=0,spos=-1,ppos=-1;
        while(ss<s.size())
        {
            if(s[ss]==p[ps] || p[ps]=='?')
            {
                ss++;
                ps++;
            }
            else if(p[ps]=='*')
            {
                spos=ss;
                ppos=ps++;
            }
            else
            {
                if(ppos>-1)
                {
                    ss=++spos;
                    ps=ppos+1;
                }
                else
                 return false;
            }
        }
        while(p[ps]=='*') ps++;
        return ps==p.size();
    }
};