LeetCode(easy)-884. Uncommon Words from Two Sentences

884. Uncommon Words from Two Sentences
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.
Example 1:
Input: A = “this apple is sweet”, B = “this apple is sour”
Output: [“sweet”,“sour”]
Example 2:
Input: A = “apple apple”, B = “banana”
Output: [“banana”]
题目：
我们给出了两个句子A和B.（一个句子是一串空格分隔的单词。每个单词只包含小写字母。）如果一个单词在其中一个句子中只显示一次，并且不出现在另一个句子中，则该单词不常见。返回所有不常见单词的列表。可以按任何顺序返回列表。
解法一：

class Solution(object):
    def uncommonFromSentences(self, A, B):
        """
        :type A: str
        :type B: str
        :rtype: List[str]
        """
        dictionary = {}
        res = []
        for word in A.split(" "):
            if word in dictionary:
                dictionary[word] +=1
            else:
                dictionary[word] =1
        for word in B.split(" "):
            if word in dictionary:
                dictionary[word] +=1
            else:
                dictionary[word] =1
        for word in dictionary:
            if dictionary[word] ==1:
                res.append(word)
        return res

Runtime: 24 ms