Leetcode: Uncommon Words from Two Sentences

Uncommon Words from Two Sentences



Similar Problems:


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:

  1. 0 <= A.length <= 200
  2. 0 <= B.length <= 200
  3. A and B both contain only spaces and lowercase letters.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


  • Solution:
// Blog link: https://code.dennyzhang.com/uncommon-words-from-two-sentences
// Basic Ideas: hashmap
// Complexity: Time O(n), Space O(n)
import "strings"
func uncommonFromSentences(A string, B string) []string {
    m := map[string]int{}
    res := []string{}
    for _, s := range []string{A, B} {
        for _, word := range strings.Split(s, " ") {
            m[word]++
        }
    }
    for key := range m {
        if m[key] == 1 {
            res = append(res, key)
        }
    }
    return res
}
linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.