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

class Solution {
public:
    //贪心算法
    bool isMatch(string s, string p) {
        int m=s.length();int n=p.length();
        int i=0,j=0,match,asterisk = -1;
        while(i<m){
            if(j<n&&p[j]=='*'){
                match=i;
                asterisk=j++;
            }
            else if(j<n&&(s[i]==p[j]||p[j]=='?')){
                i++;j++;
            }
            else if(asterisk>=0){
                i=++match;
                j=asterisk+1;
            }
            else return false;
        }
        while(j<n&&p[j]=='*')j++;
        return j==n;
    }
};

关键在于对字符'*'的处理。