LeetCode | 44. 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) {
        int sLen = s.length();
		int pLen = p.length();
		vector<vector<bool>> dp(sLen + 1, vector<bool>(pLen + 1, 0));
		dp[0][0] = true;
		for (int i = 1; i <= sLen; i++)
			dp[i][0] = false;
		for (int i = 1; i <= pLen; i++)
			dp[0][i] = dp[0][i - 1] && p[i - 1] == '*';

		for (int i = 1; i <= sLen; i++)
		{
			for (int j = 1; j <= pLen; j++)
			{
				if (p[j - 1] == '*')
				{
					dp[i][j] = dp[i][j - 1] || dp[i - 1][j];
				}
				else
				{
					dp[i][j] = dp[i - 1][j - 1] && (s[i - 1] == p[j - 1] || '?' == p[j - 1]);
				}
			}
		}
		return dp[sLen][pLen];
    }
};

一次AC～