LeetCode-Wildcard Matching (JAVA)

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 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

说明：定义dp[i][j] 为p的前i个字符是否能转为s的前j个字符,dp[0][0]=true
1.dp[i][0]=dp[i - 1][0] && p[i - 1]’*’
2.p[i - 1] == s[j - 1] || p[i - 1]’?’ dp[i][j]=dp[i - 1][j - 1]
3.p[i - 1]== ‘*’ 时，如果dp[i - 1][j]==true 或者dp[i][j - 1] == true,dp[i][j] =true

第3条的说明可以参考如下：
p: ab
s: adceb
对于：p的而言，首先要确定前面的第i- 1个字符能匹配成功能匹配到s的第前j个字符（dp[i - 1][j] = true），匹配成功后，对于j后面的字符都能匹配成功(也即是：dp[i][j - 1]= true时，dp[i][j] = true),，

class Solution {
    public boolean isMatch(String s, String p) {
        int sl = s.length();
        int pl = p.length();
        boolean[][] dp = new boolean[pl + 1][sl + 1];
        dp[0][0] = true;
        for(int i = 1; i <= pl; i++) {
            dp[i][0] = p.charAt(i - 1) =='*' && dp[i - 1][0];
            
            for(int j = 1; j <= sl; j++) {
                
                if(p.charAt(i - 1) == s.charAt(j - 1) || p.charAt(i - 1) == '?') {
                    dp[i][j] = dp[i - 1][j - 1];
                } else if(p.charAt(i - 1) == '*') {
                    dp[i][j] = dp[i - 1][j] || dp[i][j-1];
                } else {
                    dp[i][j] = false;
                }
                
                
            }
        }
        return dp[pl][sl];
    }
}