LeetCode44. Wildcard Matching（C++）

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

本题与第十题的区别就在于，本题的*是可以匹配任意字符组成的任意长度的字符串。

方法一：动态规划

dp[i][j]：s串的前 i 个字符与p串的前 p 个字符是否匹配

首先先更新dp[0][i]，即p串的前i个字符能否与空串匹配，然后依次更新dp[i][j]，当遇到s[i-1] == p[j-1] || p[j-1] == '?'，则此时dp[i][j] = dp[i-1][j-1]，若p[j-1] == '*'，则需要分几种情况判断。

class Solution {
public:
    bool isMatch(string s, string p) {
        int m = s.length(), n = p.length();
        vector<vector<bool>>dp(m+1, vector<bool>(n+1, false));
        dp[0][0] = true;
        for(int i = 1; i <= n; ++ i)
            if(p[i - 1] == '*')
                dp[0][i] = dp[0][i - 1];
        for(int i = 1; i <= m; ++ i)
            for(int j = 1; j <= n; ++ j){
                if(s[i-1] == p[j-1] || p[j-1] == '?')
                    dp[i][j] = dp[i-1][j-1];
                if(p[j-1] == '*')
                    dp[i][j] = dp[i-1][j] || dp[i][j-1] || dp[i-1][j-1];
            }
        return dp[m][n];
    }
};

方法二：

动态规划的时间复杂度是n*m，其实本题可以优化到n；

用pos记录上一个出现‘*’的地方，cur记录s串中可以匹配的位置。

class Solution {
public:
    bool isMatch(string s, string p) {
        int m = s.length(),n = p.length(), i = 0, j = 0;
        int cur = 0, pos = -1;
        while(i < m){
            if(j < n && (s[i] == p[j] || p[j] == '?')){
                ++ i; ++ j;
            }
            else if(j < n && p[j] == '*'){
                pos = j;
                cur = i;
                ++ j;
            }
            else if(pos != -1){
                j = pos + 1;
                i = ++ cur;
            }
            else
                return false;
        }
        while(j < n && p[j] == '*')
            ++ j;
        return j == n;
    }
    
};