[LintCode] 通配符查询

动态规划：

class Solution {
public:
    /**
     * @param s: A string 
     * @param p: A string includes "?" and "*"
     * @return: A boolean
     */
    bool isMatch(const char *s, const char *p) {
        // write your code here
        int m = strlen(s), n = strlen(p);
        vector<bool> cur(m + 1, false);
        cur[0] = true;
        for (int j = 1; j <= n; j++) {
            bool pre = cur[0];
            cur[0] = cur[0] && p[j - 1] == '*';
            for (int i = 1; i <= m; i++) {
                bool temp = cur[i];
                if (p[j - 1] != '*')
                    cur[i] = pre && (s[i - 1] == p[j - 1] || p[j - 1] == '?');
                else cur[i] = cur[i - 1] || cur[i];
                pre = temp;
            }
        }
        return cur[m];
    }
};

贪心：

class Solution {
public:
    /**
     * @param s: A string 
     * @param p: A string includes "?" and "*"
     * @return: A boolean
     */
    bool isMatch(const char *s, const char *p) {
        // write your code here
        const char* asterisk = NULL;
        const char* match = NULL;
        while (*s) {
            if (*p == '*') {
                asterisk = p++;
                match = s;
            }
            else if (*s == *p || *p == '?') {
                s++;
                p++;
            }
            else if (asterisk) {
                s = ++match;
                p = asterisk + 1;
            }
            else return false;
        }
        while (*p == '*') p++;
        return !*p;
    }
};