feat: add solutions to leetcode problem: No.1836. Remove Duplicates From an Unsorted Linked List

Author: yanglbme

README.md

@@ -1,5 +1,5 @@
 <p align="center">
-  <a href="https://github.com/doocs/leetcode"><img src="./images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
 </p>
 
 <p align="center">
@@ -209,12 +209,12 @@
 1. 你也可以参考帮助文档「[GitHub](https://help.github.com/cn) / [Gitee](https://gitee.com/help)」了解更多细节。
 
 <p align="center">
-  <a href="https://github.com/doocs/leetcode"><img src="./images/how-to-contribute.png" alt="how-to-contribute"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/images/how-to-contribute.png" alt="how-to-contribute"></a>
 </p>
 
 [Gitpod.io](https://www.gitpod.io) 是一个免费的在线开发环境，你也可以使用它参与本项目。
 
-[![Open in Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/doocs/leetcode)
+<a href="https://gitpod.io/#https://github.com/doocs/leetcode" target="_blank" alt="Open in Gitpod"><img src="https://gitpod.io/button/open-in-gitpod.svg"></a>
 
 ## 贡献者
 
@@ -236,10 +236,10 @@
 
 知名互联网科技博主 [@爱可可-爱生活](https://weibo.com/fly51fly) 微博推荐。
 
-[![fly51fly](./images/recommender-fly51fly.png)](https://weibo.com/fly51fly)
+<a href="https://weibo.com/fly51fly" target="_blank"><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/images/recommender-fly51fly.png"></a>
 
 ## 许可证
 
 <a rel="license" href="http://creativecommons.org/licenses/by-sa/4.0/">知识共享 版权归属-相同方式共享 4.0 国际 公共许可证</a>
 
-[![FOSSA Status](https://app.fossa.com/api/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode.svg?type=large)](https://app.fossa.com/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode?ref=badge_large)
+<a href="https://app.fossa.com/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode?ref=badge_large" target="_blank"><img src="https://app.fossa.com/api/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode.svg?type=large"></a>

README_EN.md

@@ -1,5 +1,5 @@
 <p align="center">
-  <a href="https://github.com/doocs/leetcode"><img src="./images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/images/leetcode-doocs.png" alt="LeetCode-GitHub-Doocs"></a>
 </p>
 
 <p align="center">
@@ -200,12 +200,12 @@ I'm looking for long-term contributors/partners to this repo! Send me [PRs](http
 1. See [CONTRIBUTING](https://github.com/doocs/.github/blob/main/CONTRIBUTING.md) or [GitHub Help](https://help.github.com/en) for more details.
 
 <p align="center">
-  <a href="https://github.com/doocs/leetcode"><img src="./images/how-to-contribute.png" alt="how-to-contribute"></a>
+  <a href="https://github.com/doocs/leetcode"><img src="https://cdn.jsdelivr.net/gh/doocs/leetcode@main/images/how-to-contribute.png" alt="How to contribute"></a>
 </p>
 
 You can also contribute to [doocs/leetcode](https://github.com/doocs/leetcode) using [Gitpod.io](https://www.gitpod.io), a free online dev environment with a single click.
 
-[![Open in Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/doocs/leetcode)
+<a href="https://gitpod.io/#https://github.com/doocs/leetcode" target="_blank" alt="Open in Gitpod"><img src="https://gitpod.io/button/open-in-gitpod.svg"></a>
 
 ## Contributors
 
@@ -227,4 +227,4 @@ Thank you to all our backers and sponsors!
 
 This work is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by-sa/4.0/">Creative Commons Attribution-ShareAlike 4.0 International License</a>.
 
-[![FOSSA Status](https://app.fossa.com/api/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode.svg?type=large)](https://app.fossa.com/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode?ref=badge_large)
+<a href="https://app.fossa.com/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode?ref=badge_large" target="_blank"><img src="https://app.fossa.com/api/projects/git%2Bgithub.com%2Fdoocs%2Fleetcode.svg?type=large"></a>

solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README.md

@@ -19,15 +19,65 @@ None
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def deleteDuplicatesUnsorted(self, head: ListNode) -> ListNode:
+        cur = head
+        counter = collections.Counter()
+        while cur:
+            counter[cur.val] += 1
+            cur = cur.next
+
+        dummy = ListNode(0, head)
+        pre, cur = dummy, head
+        while cur:
+            if counter[cur.val] > 1:
+                pre.next = cur.next
+            else:
+                pre = cur
+            cur = cur.next
+        return dummy.next
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode deleteDuplicatesUnsorted(ListNode head) {
+        ListNode cur = head;
+        Map<Integer, Integer> counter = new HashMap<>();
+        for (; cur != null; cur = cur.next) {
+            counter.put(cur.val, counter.getOrDefault(cur.val, 0) + 1);
+        }
+
+        ListNode dummy = new ListNode(0, head);
+        ListNode pre = dummy;
+        for (cur = head; cur != null; cur = cur.next) {
+            if (counter.get(cur.val) > 1) {
+                pre.next = cur.next;
+            } else {
+                pre = cur;
+            }
+        }
+        return dummy.next;
+    }
+}
 ```
 
 ### **...**

solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/README_EN.md

@@ -68,13 +68,63 @@
 ### **Python3**
 
 ```python
-
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def deleteDuplicatesUnsorted(self, head: ListNode) -> ListNode:
+        cur = head
+        counter = collections.Counter()
+        while cur:
+            counter[cur.val] += 1
+            cur = cur.next
+
+        dummy = ListNode(0, head)
+        pre, cur = dummy, head
+        while cur:
+            if counter[cur.val] > 1:
+                pre.next = cur.next
+            else:
+                pre = cur
+            cur = cur.next
+        return dummy.next
 ```
 
 ### **Java**
 
 ```java
-
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode deleteDuplicatesUnsorted(ListNode head) {
+        ListNode cur = head;
+        Map<Integer, Integer> counter = new HashMap<>();
+        for (; cur != null; cur = cur.next) {
+            counter.put(cur.val, counter.getOrDefault(cur.val, 0) + 1);
+        }
+
+        ListNode dummy = new ListNode(0, head);
+        ListNode pre = dummy;
+        for (cur = head; cur != null; cur = cur.next) {
+            if (counter.get(cur.val) > 1) {
+                pre.next = cur.next;
+            } else {
+                pre = cur;
+            }
+        }
+        return dummy.next;
+    }
+}
 ```
 
 ### **...**

solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/Solution.java

@@ -0,0 +1,30 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode deleteDuplicatesUnsorted(ListNode head) {
+        ListNode cur = head;
+        Map<Integer, Integer> counter = new HashMap<>();
+        for (; cur != null; cur = cur.next) {
+            counter.put(cur.val, counter.getOrDefault(cur.val, 0) + 1);
+        }
+
+        ListNode dummy = new ListNode(0, head);
+        ListNode pre = dummy;
+        for (cur = head; cur != null; cur = cur.next) {
+            if (counter.get(cur.val) > 1) {
+                pre.next = cur.next;
+            } else {
+                pre = cur;
+            }
+        }
+        return dummy.next;
+    }
+}

solution/1800-1899/1836.Remove Duplicates From an Unsorted Linked List/Solution.py

@@ -0,0 +1,22 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def deleteDuplicatesUnsorted(self, head: ListNode) -> ListNode:
+        cur = head
+        counter = collections.Counter()
+        while cur:
+            counter[cur.val] += 1
+            cur = cur.next
+
+        dummy = ListNode(0, head)
+        pre, cur = dummy, head
+        while cur:
+            if counter[cur.val] > 1:
+                pre.next = cur.next
+            else:
+                pre = cur
+            cur = cur.next
+        return dummy.next