📝 add lc 82

DreamCats · DreamCats · commit 6b52878d2e2c · 2021-04-09T12:58:31.000+08:00
diff --git a/Java/alg/README.md b/Java/alg/README.md
@@ -127,6 +127,7 @@
 - [77.组合](lc/77.组合.md)
 - [78.子集](lc/78.子集.md)
 - [79.单词搜索](lc/79.单词搜索.md)
+- [82.删除排序链表中的重复元素2](lc/82.删除排序链表中的重复元素2.md)
 
 ## 笔试
 
diff --git a/Java/alg/lc/82.删除排序链表中的重复元素2.md b/Java/alg/lc/82.删除排序链表中的重复元素2.md
@@ -0,0 +1,88 @@
+# 82. 删除排序链表中的重复元素 II
+
+[url](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-ii/)
+
+## 题目
+
+存在一个按升序排列的链表，给你这个链表的头节点 head ，请你删除链表中所有存在数字重复情况的节点，只保留原始链表中 没有重复出现 的数字。
+
+返回同样按升序排列的结果链表。
+
+![](https://assets.leetcode.com/uploads/2021/01/04/linkedlist1.jpg)
+
+
+```
+输入：head = [1,2,3,3,4,4,5]
+输出：[1,2,5]
+```
+
+
+
+
+## 方法
+
+
+
+
+## code
+
+### js
+
+```js
+let deleteDuplicates = head => {
+    if (head === null || head.next === null)
+        return head;
+    let next = head.next;
+    if (head.val === next.val) {
+        while (next !== null && head.val === next.val)
+            next = next.next;
+        return deleteDuplicates(head);
+    } else {
+        head.next = deleteDuplicates(head.next);
+        return head;
+    }
+}
+```
+
+### go
+
+```go
+func deleteDuplicates2(head *ListNode) *ListNode {
+	if head == nil || head.Next == nil {
+		return head
+	}
+	next := head.Next
+	if head.Val == next.Val {
+		for next != nil && head.Val == next.Val {
+			next = next.Next
+		}
+		return deleteDuplicates2(next)
+	} else {
+		head.Next = deleteDuplicates2(head.Next)
+		return head
+	}
+}
+```
+
+
+
+### java
+
+```java
+class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if (head == null || head.next == null)
+            return head;
+        ListNode next = head.next;
+        if (head.val == next.val) {
+            while (next != null && head.val == next.val)
+                next = next.next;
+            return deleteDuplicates(next);
+        } else {
+            head.next = deleteDuplicates(head.next);
+            return head;
+        }
+    }
+}
+```
+
