Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public boolean wordPattern(String pattern, String str) {
- HashMap<Character, String> map1 = new HashMap<>();
- HashMap<String, Character> map2 = new HashMap<>();
- String[]word = str.split(" ");
- if(word.length!=pattern.length())return false;
- for(int i=0;i<pattern.length();i++){
- if(map1.containsKey(pattern.charAt(i)) && map1.get(pattern.charAt(i)).equals(word[i])==false)return false;
- if(map2.containsKey(word[i]) && map2.get(word[i])!=pattern.charAt(i))return false;
- map1.put(pattern.charAt(i), word[i]);
- map2.put(word[i], pattern.charAt(i));
- }
- return true;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement