Merge branch 'master' of https://github.com/fishercoder1534/Leetcode

Author: fishercoder1534

README.md

@@ -30,6 +30,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
 |896|[Monotonic Array](https://leetcode.com/problems/monotonic-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_896.java) | O(n) | O(1) | |Easy|
+|884|[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_884.java) | O(n) | O(k) | |Easy|
 |844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_844.java) | O(n) | O(1) | |Easy|
 |832|[Flipping an Image](https://leetcode.com/problems/flipping-an-image/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_832.java) | O(n) | O(1) | |Easy|
 |830|[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_830.java) | O(n) | O(n) | |Easy|

src/main/java/com/fishercoder/solutions/_884.java

@@ -0,0 +1,59 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+
+/**
+ * 884. Uncommon Words from Two Sentences
+ *
+ * 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 and B both contain only spaces and lowercase letters.
+ */
+public class _884 {
+  public static class Solution1 {
+    public String[] uncommonFromSentences(String A, String B) {
+      Map<String, Integer> map = new HashMap<>();
+      for (String word : A.split(" ")) {
+        map.put(word, map.getOrDefault(word, 0) + 1);
+      }
+
+      for (String word : B.split(" ")) {
+        map.put(word, map.getOrDefault(word, 0) + 1);
+      }
+      List<String> result = new ArrayList<>();
+      for (String key : map.keySet()) {
+        if (map.get(key) == 1) {
+          result.add(key);
+        }
+      }
+      String[] strs = new String[result.size()];
+      result.toArray(strs);
+      return strs;
+    }
+  }
+}

src/test/java/com/fishercoder/_884Test.java

@@ -0,0 +1,31 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._884;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _884Test {
+  private static _884.Solution1 solution1;
+  private static String[] expected;
+
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _884.Solution1();
+  }
+
+  @Test
+  public void test1() {
+    expected = new String[] {"sweet", "sour"};
+    assertArrayEquals(expected,
+        solution1.uncommonFromSentences("this apple is sweet", "this apple is sour"));
+  }
+
+  @Test
+  public void test2() {
+    expected = new String[] {"banana"};
+    assertArrayEquals(expected,
+        solution1.uncommonFromSentences("apple apple", "banana"));
+  }
+}