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

解题思路：

逐步匹配，'?'可以任意匹配一个字符，'*'可以任意匹配任何长度字符，在匹配时，每当遇到"*"记录下当前"*"的位置以及当前s串匹配到的位置，当失配时检测之前是否有'*'出现过，若出现过则可匹配s串当前的字符。主要是检测时的优先级，固定字符 = "?" > "*"。

class Solution {
public:
    bool isMatch(string s, string p) {
        int ls = s.length(), lp = p.length();
        int i = 0, j = 0;
        int st = -1, ii = i;
        while(i < ls){
            if(p[j] == '?' || p[j] == s[i]){
                i++, j++;
                continue;
            }
            if(p[j] == '*'){
                st = j++, ii = i;
                continue;
            }
            if(st != -1){
                j = st + 1;
                i = ++ii;
                continue;
            }
            return false;
        }
        while(j < lp)if(p[j++] != '*')return false;
        return true;
    }
};