1
class Solution {
2
  public boolean wordPattern(String pattern, String s) {
3
    String[] arr = s.split(" ");
4
    if (pattern.length() != arr.length) return false;
5
    Map<Character, String> map = new HashMap<Character, String>();
6

7
    for (int i = 0; i < pattern.length(); i++) {
8
      char ch = pattern.charAt(i);
9
      if (map.containsKey(ch)) {
10
        if (!map.get(ch).equals(arr[i])) {
11
          return false;
12
        }
13
      } else if (!(map.containsKey(ch) || map.containsValue(arr[i]))) {
14
        map.put(ch, arr[i]);
15
      } else {
16
        return false;
17
      }
18
    }
19
    return true;
20
  }
21
}