【LeetCode】pattern模式是否匹配源字符串：Wildcard Matching

Given an input string (s) and a pattern (p), 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).

Note:

• s could be empty and contains only lowercase letters a-z.
• p could be empty and contains only lowercase letters a-z, and characters like ? or *.

Example 1:

Input:
s = "aa"
p = "a"
Output: false
Explanation: "a" does not match the entire string "aa".

Example 2:

Input:
s = "aa"
p = "*"
Output: true
Explanation: '*' matches any sequence.

Example 3:

Input:
s = "cb"
p = "?a"
Output: false
Explanation: '?' matches 'c', but the second letter is 'a', which does not match 'b'.

Example 4:

Input:
s = "adceb"
p = "*a*b"
Output: true
Explanation: The first '*' matches the empty sequence, while the second '*' matches the substring "dce".

Example 5:

Input:
s = "acdcb"
p = "a*c?b"
Output: false

解法一：双指针法

class Solution {
public:
    bool isMatch(string s, string p) {
        return isMatch(s.c_str(), p.c_str());
    }
    
    bool isMatch(const char* s, const char* p) {
        int lenS = strlen(s);
        int lenP = strlen(p);
        
        int i = 0, j = 0; // 分别指向源字符串和模式字符串
        int iStar = -1; // *号匹配到s串中的位置
        int jStar = -1; // 模式字符串中*号的位置
    
        while(i < lenS) {
            if(j < lenP && p[j] == '*') {
                iStar = i;
                jStar = j++;
            } else if(p[j] == s[i] || p[j] == '?') {
                i++;
                j++;
            } else if(iStar >= 0) {
                i = ++iStar;
                j = jStar + 1;
            } else {
                return false;
            }
        }
        
        while(j < lenP && p[j] == '*') {
            j++;
        }
        
        return j == lenP;
    }
};

解法二：动态规划

class Solution {
public:
    bool isMatch(string s, string p) {
        int m = s.size();
        int n = p.size();
        
        bool dp[m+1][n+1];
        dp[0][0] = true;
        for(int i = 0; i < m; i++) {
            dp[i+1][0] = false;
        }
        for(int j = 0; j < n; j++) {
            dp[0][j+1] = dp[0][j] && p[j] == '*';
        }
        
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(p[j] != '*') {
                    dp[i+1][j+1] = dp[i][j] && (p[j] == s[i] || p[j] == '?');
                } else {
                    // *号匹配0个字符, dp[i+1][j]
                    // *号匹配1个或多个字符, dp[i][j+1]
                    dp[i+1][j+1] = dp[i+1][j] || dp[i][j+1];
                }
            }
        }
        
        return dp[m][n];
    }
};

解法三：递归解法

class Solution {
public:
    bool isMatch(string s, string p) {
        return isMatch(s.c_str(), p.c_str());
    }
    
    bool isMatch(const char* s, const char* p) {
        if(*p == '*') {
            while(*p == '*')
                p++;
            
            if(*p=='\0')
                return true;
            
            while(*s != '\0' && !isMatch(s, p))
                s++;
            
            return *s != '\0';
        } else if(*p == '\0' || *s == '\0') {
            return *p == *s;
        } else if(*s==*p || *p == '?') {
            return isMatch(++s, ++p);
        } else {
            return false;
        }
    }
};

参考资料：

https://www.cnblogs.com/grandyang/p/4401196.html