add 1133

fishercoder1534 · fishercoder1534 · commit 5ddc852b3c51 · 2019-12-10T07:23:07.000-08:00
diff --git a/README.md b/README.md
@@ -31,6 +31,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1150|[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java) | | | |Easy||
 |1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) | O(n) | O(n) | |Easy||
 |1134|[Armstrong Number](https://leetcode.com/problems/armstrong-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1134.java) |  |  | [:tv:](https://www.youtube.com/watch?v=HTL7fd4HPf4)|Easy||
+|1133|[Largest Unique Number](https://leetcode.com/problems/largest-unique-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1133.java) |  |  | |Easy||
 |1128|[Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1128.java) |  |  | [:tv:](https://www.youtube.com/watch?v=7EpEEHAAxyw)|Easy||
 |1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | O(n) | O(n) | |Easy||
 |1170|[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | | | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1133.java b/src/main/java/com/fishercoder/solutions/_1133.java
@@ -0,0 +1,42 @@
+package com.fishercoder.solutions;
+
+import java.util.TreeMap;
+
+/**
+ * 1133. Largest Unique Number
+ *
+ * Given an array of integers A, return the largest integer that only occurs once.
+ * If no integer occurs once, return -1.
+ *
+ * Example 1:
+ * Input: [5,7,3,9,4,9,8,3,1]
+ * Output: 8
+ * Explanation:
+ * The maximum integer in the array is 9 but it is repeated. The number 8 occurs only once, so it's the answer.
+ *
+ * Example 2:
+ * Input: [9,9,8,8]
+ * Output: -1
+ * Explanation:
+ * There is no number that occurs only once.
+ *
+ * Note:
+ * 1 <= A.length <= 2000
+ * 0 <= A[i] <= 1000
+ * */
+public class _1133 {
+    public static class Solution1 {
+        public int largestUniqueNumber(int[] A) {
+            TreeMap<Integer, Integer> treeMap = new TreeMap<>((a, b) -> b - a);
+            for (int num : A) {
+                treeMap.put(num, treeMap.getOrDefault(num, 0) + 1);
+            }
+            for (int key : treeMap.keySet()) {
+                if (treeMap.get(key) == 1) {
+                    return key;
+                }
+            }
+            return -1;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1133Test.java b/src/test/java/com/fishercoder/_1133Test.java
@@ -0,0 +1,30 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1133;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1133Test {
+    private static _1133.Solution1 solution1;
+    private static int[] A;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1133.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        A = new int[]{5, 7, 3, 9, 4, 9, 8, 3, 1};
+        assertEquals(8, solution1.largestUniqueNumber(A));
+    }
+
+    @Test
+    public void test2() {
+        A = new int[]{9, 9, 8, 8};
+        assertEquals(-1, solution1.largestUniqueNumber(A));
+    }
+
+}
