public static boolean isMatch(String s, String p) { int m = s.length(); int n = p.length(); boolean[][] dp = new boolean[m + 1][n + 1]; dp[0][0] = true; for (int i = 1; i <= n; i++) { if (p.charAt(i - 1) == '*') { dp[0][i] = true; } else { break; } } for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { char ch = s.charAt(i - 1); // 注意：*和?处理的是字母和数字，所以要加判断 if (p.charAt(j - 1) == '*') { dp[i][j] = dp[i][j - 1] || ((dp[i - 1][j] || dp[i - 1][j - 1]) && Character.isLetterOrDigit(ch)); } else if (p.charAt(j - 1) == '?' && Character.isLetterOrDigit(ch) ) { dp[i][j] = dp[i - 1][j - 1]; } else if (s.charAt(i - 1) == p.charAt(j - 1)) { dp[i][j] = dp[i - 1][j - 1]; } } } return dp[m][n]; } public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNext()) { String pattern = in.nextLine().toLowerCase(); String str = in.nextLine().toLowerCase(); boolean ans = isMatch(str, pattern); System.out.println(ans); } }