【python3】leetcode 884. Uncommon Words from Two Sentences (easy)

120 篇文章 0 订阅

 884. Uncommon Words from Two Sentences (easy) 

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"]

首先要满足出现only once

其次是异或,即只在A中出现或只在B中出现 

class Solution:
    def uncommonFromSentences(self, A, B):
        """
        :type A: str
        :type B: str
        :rtype: List[str]
        """
        uncommon = []
        AList = A.split()
        BList = B.split()
        Acount = collections.Counter(AList)
        Bcount = collections.Counter(BList)
        Aset = {key for key,count in Acount.items() if count == 1}
        Bset = {key for key,count in Bcount.items() if count == 1}
        ABset = set(AList) & set(BList)
        return list({x for x in Aset^Bset if x not in ABset})

Runtime: 36 ms, faster than 98.82% of Python3 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值