Problem Description:
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 lettersa-z
.p
could be empty and contains only lowercase lettersa-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
Code:
class Solution {
public boolean isMatch(String s, String p) {
int len_s = s.length();
int len_p = p.length();
boolean[][] dp = new boolean[len_s + 1][len_p + 1];
dp[0][0] = true;
for(int i = 1; i <= len_p; i++) {
if(p.charAt(i - 1) == '*') {
dp[0][i] = dp[0][i - 1];
}
}
for(int i = 1; i <= len_s; i++) {
for(int j = 1; j <= len_p; j++) {
char sc = s.charAt(i - 1);
char pc = p.charAt(j - 1);
if( sc==pc || pc == '?') {
dp[i][j] = dp[i - 1][j - 1];
} else if(pc == '*'){
dp[i][j] = dp[i - 1][j] || dp[i][j-1];
}
}
}
return dp[len_s][len_p];
}
}