Advertisement
Guest User

Untitled

a guest
Mar 26th, 2019
106
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 0.68 KB | None | 0 0
  1. class Solution {
  2.     public boolean wordPattern(String pattern, String str) {
  3.         HashMap<Character, String> map1 = new HashMap<>();
  4.         HashMap<String, Character> map2 = new HashMap<>();
  5.         String[]word = str.split(" ");
  6.         if(word.length!=pattern.length())return false;
  7.         for(int i=0;i<pattern.length();i++){
  8.             if(map1.containsKey(pattern.charAt(i)) && map1.get(pattern.charAt(i)).equals(word[i])==false)return false;
  9.             if(map2.containsKey(word[i]) && map2.get(word[i])!=pattern.charAt(i))return false;
  10.             map1.put(pattern.charAt(i), word[i]);
  11.             map2.put(word[i], pattern.charAt(i));
  12.         }
  13.         return true;
  14.     }
  15. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement