Untitled
unknown
plain_text
3 years ago
939 B
4
Indexable
class Solution { public boolean isMatch(String s, String p) { boolean[][] arr = new boolean[s.length() + 1][p.length() + 1]; arr[0][0] = true; for (int i = 0; i < p.length(); i++) { arr[0][i + 1] = (p.charAt(i) == '*') && arr[0][i - 1]; } for (int i = 0; i < s.length(); i++) { for (int j = 0; j < p.length(); j++) { if (s.charAt(i) == p.charAt(j) || p.charAt(j) == '.') { arr[i + 1][j + 1] = arr[i][j]; } else if (p.charAt(j) == '*') { if (arr[i + 1][j - 1]) { arr[i + 1][j + 1] = true; } else if (p.charAt(j - 1) == '.' || s.charAt(i) == p.charAt(j - 1)) { arr[i + 1][j + 1] = arr[i][j + 1]; } } } } return arr[s.length()][p.length()]; } }
Editor is loading...