[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 + , false);
         cur[] = true;
         for (int j = ; j <= n; j++) {
             bool pre = cur[];
             cur[] = cur[] && p[j - ] == '*';
             for (int i = ; i <= m; i++) {
                 bool temp = cur[i];
                 if (p[j - ] != '*')
                     cur[i] = pre && (s[i - ] == p[j - ] || p[j - ] == '?');
                 else cur[i] = cur[i - ] || 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 + ;
             }
             else return false;
         }
         while (*p == '*') p++;
         return !*p;
     }
 };