LeetCode OJ:Wildcard Matching

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(const char *s, const char *p) {
        int m=strlen(p);
        int n=strlen(s);
        
        const char* tmp = p;  
        int cnt = 0;  
        while (*tmp ) if (*(tmp++) != '*') cnt++;  
        if (cnt > n) return false;  
        
        vector<vector<bool>> dp(m+1);
        dp[0].resize(n+1);
        
        dp[0][0]=true;
        for(int i=1; i<=m; i++){
            dp[i].assign(n+1,false);
            if(dp[i-1][0] && p[i-1]=='*') dp[i][0]=true;
            
            for(int j=1; j<=n; j++){
                if (p[i-1] == '*') dp[i][j] = (dp[i][j-1] || dp[i-1][j]);  
                else if (p[i-1] == '?' || p[i-1] == s[j-1]) dp[i][j] = dp[i-1][j-1];  
                else dp[i][j] = false; 
            }
        }
        return dp[m][n];
    }
};

answer2

迭代版

class Solution {
public:
    bool isMatch(const char *s, const char *p) {
        bool star=false;
        const char *str,*ptr;
        for(str=s,ptr=p;*str!='\0';str++,ptr++){
            switch(*ptr){
                case '?':break;
                case '*':
                    star=true;
                    s=str,p=ptr;
                    while(*p=='*')p++;
                    if(*p=='\0')return true;
                    str=s-1;
                    ptr=p-1;
                    break;
                default:
                    if(*str!=*ptr){
                        if(!star)return false;
                        s++;
                        str=s-1;
                        ptr=p-1;
                    }
            }
        }
        while(*ptr =='*')ptr++;
        return (*ptr == '\0');
    }
};