LeetCode – Refresh – Wildcard Matching

This question is different from Regular Expression Matching.

Because this does not need totally match. We just have to much p is part of s.

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        const char *olds = s, *oldp = p;
        bool star = false;
        while (*s) {
            if (*s != *p) {
                if (*p == '?') {
                    s++, p++;
                } else if (*p == '*') {
                    while (*p == '*') p++;
                    if (*p == '\0') return true;
                    star = true;
                    olds = s, oldp = p;
                } else if (star) {
                    olds++;
                    s = olds, p = oldp;
                } else return false;
            } else s++, p++;
        }
        while (*p == '*') p++;
        return *p == '\0';
    }
};