Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0801_0900.s0884_uncommon_words_from_two_sentences.Solution

```
public class Solution
extends Object
```
884 - Uncommon Words from Two Sentences.
Easy

A sentence is a string of single-space separated words where 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.

Given two sentences s1 and s2, return a list of all the uncommon words. You may return the answer in any order.

Example 1:

Input: s1 = “this apple is sweet”, s2 = “this apple is sour”

Output: [“sweet”,“sour”]

Example 2:

Input: s1 = “apple apple”, s2 = “banana”

Output: [“banana”]

Constraints:
- 1 <= s1.length, s2.length <= 200
- s1 and s2 consist of lowercase English letters and spaces.
- s1 and s2 do not have leading or trailing spaces.
- All the words in s1 and s2 are separated by a single space.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  String[] uncommonFromSentences(String s1, String s2)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

uncommonFromSentences

public String[] uncommonFromSentences(String s1,
                                      String s2)