[LeetCode] 884. Uncommon Words from Two Sentences_Easy tag: Hash Table

We are given two sentences A and B.  (A sentence is a string of space separated words.  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.

Return a list of all uncommon words. 

You may return the list in any order.

Input: A = "this apple is sweet", B = "this apple is sour"
Output: ["sweet","sour"]

Input: A = "apple apple", B = "banana"
Output: ["banana"]

class Solution:
    def uncommonWord(self, A, B):
        words = A.split() +B.split()
        ans, d = [], collections.Counter(words)
        for k in d.keys():
            if d[k] == 1:
                ans.append(k)
        return ans

[LeetCode] 884. Uncommon Words from Two Sentences_Easy tag: Hash Table

原文：https://www.cnblogs.com/Johnsonxiong/p/9499588.html