Advertisement
Khadija_Assem

Untitled

Jan 16th, 2020
118
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.00 KB | None | 0 0
  1. class Solution {
  2. public String mostCommonWord(String paragraph, String[] banned) {
  3. paragraph = paragraph.toLowerCase();
  4. String[] ss = paragraph.split("[^\\w']+|' *");
  5. Map<String,Integer> map = new HashMap<>();
  6. for (int i=0;i<ss.length;i++){
  7. if (map.containsKey(ss[i])){
  8. int n = map.get(ss[i])+1;
  9. map.put(ss[i],n++);
  10. }
  11. else map.put(ss[i],0);
  12. }
  13. List<Map.Entry<String,Integer>> list = new ArrayList<>(map.entrySet());
  14. list.sort(Map.Entry.comparingByValue());
  15. int i = list.size()-1;
  16. while (i>=0){
  17. int j;
  18. for (j =0;j<banned.length;j++){
  19. if (banned[j].toLowerCase().equals(list.get(i).getKey())){
  20. i--;
  21. break;
  22. }
  23. }
  24. if (j != banned.length)
  25. continue;
  26. break;
  27. }
  28. return list.get(i).getKey();
  29. }
  30. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement