https://leetcode.com/problems/third-maximum-number/solutions/2896884/java-priority-queue/
Monthly Archives: December 2022
290. Word Pattern
class Solution {
public boolean wordPattern(String pattern, String s) {
HashMap<Character,String> map = new HashMap<>();
String[] sWords = s.split(" ");
if(sWords.length != pattern.length()) return false;
for(int i = 0; i < pattern.length(); i++){
for (Map.Entry<Character, String> entry : map.entrySet()) {
if(entry.getValue().equals(sWords[i]) && entry.getKey() != pattern.charAt(i)) return false;
if(!entry.getValue().equals(sWords[i]) && entry.getKey() == pattern.charAt(i)) return false;
}
map.put(pattern.charAt(i),sWords[i]);
}
return true;
}
}