[LeetCode] 884. Uncommon Words from Two Sentences_Easy tag: Hash Table
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[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.
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"]
Note:
0 <= A.length <= 200
0 <= B.length <= 200
A
andB
both contain only spaces and lowercase letters.
思路将所有words, 计数, == 1, append进入ans
Code
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的主要内容,如果未能解决你的问题,请参考以下文章
[LeetCode] 884. Uncommon Words from Two Sentences_Easy tag: Hash Table
LeetCode Longest Uncommon Subsequence II
#Leetcode# 521. Longest Uncommon Subsequence I
LeetCode 521. Longest Uncommon Subsequence I