Add solution 082

Author: yanglbme

README.md

@@ -2,7 +2,7 @@
 ![LeetCode-GitHub](http://p9ucdlghd.bkt.clouddn.com/leetcode-github.png)
 
 [![PRs Welcome](https://img.shields.io/badge/PRs-Welcome-brightgreen.svg)](http://makeapullrequest.com)
-[![Language](https://img.shields.io/badge/Lang-Java%2FPython-blue.svg)](https://github.com/yanglbme/leetcode)
+[![Language](https://img.shields.io/badge/Lang-Java%2FPython%2FJS%2FCPP%2FGo%2F...-blue.svg)](https://github.com/yanglbme/leetcode)
 ## Introduction
 Complete solutions to Leetcode problems, updated daily.
 
@@ -16,12 +16,15 @@ Complete solutions to Leetcode problems, updated daily.
 | 021 | [Merge Two Sorted Lists](https://github.com/yanglbme/leetcode/tree/master/solution/021.Merge%20Two%20Sorted%20Lists) | `Linked List` |
 | 203 | [Remove Linked List Elements](https://github.com/yanglbme/leetcode/tree/master/solution/203.Remove%20Linked%20List%20Elements) | `Linked List` |
 
+
 ### Medium
 
 | # | Title | Tags |
 |---|---|---|
 | 019 | [Remove Nth Node From End of List](https://github.com/yanglbme/leetcode/tree/master/solution/019.Remove%20Nth%20Node%20From%20End%20of%20List) | `Linked List`, `Two Pointers` |
 | 024 | [Swap Nodes in Pairs](https://github.com/yanglbme/leetcode/tree/master/solution/024.Swap%20Nodes%20in%20Pairs) | `Linked List` |
+| 082 | [Remove Duplicates from Sorted List II](https://github.com/yanglbme/leetcode/tree/master/solution/082.Remove%20Duplicates%20from%20Sorted%20List%20II) | `Linked List` |
+
 
 ### Hard
 

solution/082.Remove Duplicates from Sorted List II/README.md

@@ -0,0 +1,49 @@
+## 删除链表中的结点
+### 题目描述
+
+给定一个排序链表，删除所有含有重复数字的节点，只保留原始链表中**没有重复出现**的数字。
+
+示例 1:
+```
+输入: 1->2->3->3->4->4->5
+输出: 1->2->5
+```
+
+示例 2:
+```
+输入: 1->1->1->2->3
+输出: 2->3
+```
+
+### 解法
+利用链表的递归性，需要注意处理连续 n(n>=3) 个结点相等的情况。若相邻只有两个结点相等，则直接返回deleteDuplicates(head.next.next)；若相邻结点超过 3 个相等，返回 deleteDuplicates(head.next)。
+
+```java
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if (head == null || head.next == null) {
+            return head;
+        }
+        
+        if (head.val == head.next.val) {
+            if (head.next.next == null) {
+                return null;
+            }
+            if (head.val == head.next.next.val) {
+                return deleteDuplicates(head.next);
+            }
+            return deleteDuplicates(head.next.next);
+        }
+        head.next = deleteDuplicates(head.next);
+        return head;
+    }
+}
+```

solution/082.Remove Duplicates from Sorted List II/Solution.java

@@ -0,0 +1,19 @@
+class Solution {
+    public ListNode deleteDuplicates(ListNode head) {
+        if (head == null || head.next == null) {
+            return head;
+        }
+        
+        if (head.val == head.next.val) {
+            if (head.next.next == null) {
+                return null;
+            }
+            if (head.val == head.next.next.val) {
+                return deleteDuplicates(head.next);
+            }
+            return deleteDuplicates(head.next.next);
+        }
+        head.next = deleteDuplicates(head.next);
+        return head;
+    }
+}