LeetCode知识点总结 - 819

LeetCode 819. Most Common Word

考点难度
Hash TableEasy
题目

Given a string paragraph and a string array of the banned words banned, return the most frequent word that is not banned. It is guaranteed there is at least one word that is not banned, and that the answer is unique.
The words in paragraph are case-insensitive and the answer should be returned in lowercase.

思路

先去掉所有banned word,再统计每一个词的出现次数。
用空格分开string:paragraph.split("\\s+")

答案
public String mostCommonWord(String paragraph, String[] banned) {
	Set<String> bannedWords = new HashSet<String>(Arrays.asList(banned));
	paragraph = paragraph.toLowerCase();
	
	String punctuation = "!?',;.";
	for (char c : punctuation.toCharArray()) {
		paragraph = paragraph.replace(c, ' '); 
	}
      
	String[] tokens = paragraph.split("\\s+");
	Map<String, Integer> frequencyTable = new HashMap<>();      
	for (String s: tokens) {
		if (!bannedWords.contains(s)) {
			frequencyTable.merge(s, 1, Integer::sum); 
		}
	}
      
	int maxFrequency = 0;
	String maxWord = "";
	for (Map.Entry<String, Integer> e : frequencyTable.entrySet()) {
		if (e.getValue() > maxFrequency) {
			maxFrequency = e.getValue();
			maxWord = e.getKey();
		}
	}
	return maxWord;
  }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值