884. 两句话中的不常见单词

最新推荐文章于 2024-09-14 21:48:00 发布

JYAyyyyyyy

最新推荐文章于 2024-09-14 21:48:00 发布

阅读量93

点赞数 1

分类专栏： leetcode 文章标签： java leetcode 哈希表

本文链接：https://blog.csdn.net/qq_45970285/article/details/107646352

版权

leetcode 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

884. 两句话中的不常见单词

在这里插入图片描述
代码：

class Solution {
    public String[] uncommonFromSentences(String A, String B) {
        if (A.equals(B)) return null;
        List<String> list = new ArrayList<>();
        String[] a = A.split(" ");
        String[] b = B.split(" ");
        HashMap<String, Integer> count1 = new HashMap<>();
        for (int i = 0; i < a.length; i++)
        {
            if (!count1.containsKey(a[i])) count1.put(a[i], 1);
            else count1.put(a[i], count1.get(a[i]) + 1);
        }
        HashMap<String, Integer> count2 = new HashMap<>();
        for (int i = 0; i < b.length; i++)
        {
            if (!count2.containsKey(b[i])) count2.put(b[i], 1);
            else count2.put(b[i], count2.get(b[i]) + 1);
        }
        for (int i = 0; i < a.length; i++)
        {
            if (count1.get(a[i]) == 1 && !count2.containsKey(a[i])) list.add(a[i]);
        }
        for (int i = 0; i < b.length; i++)
        {
            if (count2.get(b[i]) == 1 && !count1.containsKey(b[i])) list.add(b[i]);
        }
        String[] min = new String[list.size()];
        for (int i = 0; i < min.length; i++) min[i] = list.get(i);
        return min;
    }
}