add 1836

fishercoder1534 · fishercoder1534 · commit d33a25f9c0ae · 2021-08-29T12:36:43.000-07:00
diff --git a/README.md b/README.md
@@ -49,6 +49,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1845|[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1845.java) ||Medium|Heap, Design|
 |1844|[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1844.java) ||Easy|String|
 |1837|[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1837.java) ||Easy|Math, Bit Manipulation|
+|1836|[Remove Duplicates From an Unsorted Linked List](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1836.java) ||Medium|HashTable, LinkedList|
 |1833|[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1833.java) ||Medium|Array, Sort|
 |1832|[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1832.java) ||Easy|String|
 |1829|[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1829.java) ||Medium|Bit Manipulation|
diff --git a/src/main/java/com/fishercoder/solutions/_1836.java b/src/main/java/com/fishercoder/solutions/_1836.java
@@ -0,0 +1,29 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.ListNode;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _1836 {
+    public static class Solution1 {
+        public ListNode deleteDuplicatesUnsorted(ListNode head) {
+            Map<Integer, Integer> map = new HashMap<>();
+            ListNode tmp = head;
+            while (tmp != null) {
+                map.put(tmp.val, map.getOrDefault(tmp.val, 0) + 1);
+                tmp = tmp.next;
+            }
+            ListNode pre = new ListNode(-1);
+            tmp = pre;
+            while (head != null) {
+                if (map.get(head.val) == 1) {
+                    tmp.next = new ListNode(head.val);
+                    tmp = tmp.next;
+                }
+                head = head.next;
+            }
+            return pre.next;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1836Test.java b/src/test/java/com/fishercoder/_1836Test.java
@@ -0,0 +1,33 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.LinkedListUtils;
+import com.fishercoder.solutions._1836;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1836Test {
+    private static _1836.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1836.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(LinkedListUtils.contructLinkedList(new int[]{1, 3}), solution1.deleteDuplicatesUnsorted(LinkedListUtils.contructLinkedList(new int[]{1, 2, 3, 2})));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(LinkedListUtils.contructLinkedList(new int[]{}), solution1.deleteDuplicatesUnsorted(LinkedListUtils.contructLinkedList(new int[]{2, 1, 1, 2})));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(LinkedListUtils.contructLinkedList(new int[]{1, 4}), solution1.deleteDuplicatesUnsorted(LinkedListUtils.contructLinkedList(new int[]{3, 2, 2, 1, 3, 2, 4})));
+    }
+
+}
