LeetCode知识点总结 - 884

该博客介绍了如何使用哈希表解决LeetCode第884题,即从两个句子中找出不常见单词。通过遍历两个句子并记录每个单词的出现次数,筛选出仅在一个句子中出现一次的单词,最后返回这些不常见单词的列表。

LeetCode 884. Uncommon Words from Two Sentences

考点难度
Hash TableEasy
题目

A sentence is a string of single-space separated words where each word consists only of lowercase letters.

A word is uncommon if it appears exactly once in one of the sentences, and does not appear in the other sentence.

Given two sentences s1 and s2, return a list of all the uncommon words. You may return the answer in any order.

思路

用HashMap储存s1s2中每个词出现的次数,返回只出现一次的词。

答案
class Solution {
    public String[] uncommonFromSentences(String s1, String s2) {
        Map<String, Integer> count = new HashMap();
        for (String word: s1.split(" ")){
            count.put(word, count.getOrDefault(word, 0) + 1);
        }
        for (String word: s2.split(" ")){
            count.put(word, count.getOrDefault(word, 0) + 1);
        }
        List<String> ans = new LinkedList();
        for (String word: count.keySet()){
            if (count.get(word) == 1){
                ans.add(word);
            }
        }
        return ans.toArray(new String[ans.size()]);
    }
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值