LeetCode-044 Wildcard Matching

Description

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

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 = “ab”
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

Analyse

一道类似于正则匹配的题目，跟010很像，不过我认为这道题会更加的简单，也是动态规划。
ans[i][j]为s串的前i个字符和p串的前j个字符匹配成功，则最终结果为ans[len1][len2]，（len1为s串的长度，len2为p串的长度）。
转移方程为：

1. ans[i][j]=ans[i][j-1]（*不当作字符用）
2. ans[i][j]=ans[i][j-1] | ans[i][j-1] (i>0)（*当作任何字符用或者不当作字符用）
3. ans[i][j]=ans[i-1][j-1] (i>0 && (s[i-1] == p[j-1] || p[j-1] == ‘?’))（字符匹配或者有问号）

Code

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