Untitled
unknown
plain_text
2 months ago
728 B
5
Indexable
class Solution { public boolean wordPattern(String pattern, String str) { // if(pattern.length()!=) String[] words = str.split(" "); if(pattern.length()!=words.length) return false; HashMap<Character,String> map = new HashMap<>(); for(int i=0;i<pattern.length();i++){ char c = pattern.charAt(i); if(map.containsKey(c)){ if(!map.get(c).equals(words[i])){ return false; } }else{ if(map.containsValue(words[i])){ return false; } map.put(c,words[i]); } } return true; } }
Editor is loading...
Leave a Comment