Skip to content

Latest commit

 

History

History
111 lines (43 loc) · 1.69 KB

File metadata and controls

111 lines (43 loc) · 1.69 KB

中文文档

Description

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:

    <li><code>0 &lt;= A.length &lt;= 200</code></li>
    
    <li><code>0 &lt;= B.length &lt;= 200</code></li>
    
    <li><code>A</code> and <code>B</code> both contain only spaces and lowercase letters.</li>
    

Solutions

Python3

Java

...