solves remove duplicate from sorted list II

Author: anishLearnsToCode

README.md

@@ -75,6 +75,7 @@
 |  79  | [Word Search](https://leetcode.com/problems/word-search)                                                                                                  |                                                                   [![Java](assets/java.png)](src/WordSearch.java)                                                                    |                                                                                                                                   |
 |  80  | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)                                            |                                                        [![Java](assets/java.png)](src/RemoveDuplicatesFromSortedArrayII.java)                                                        |                                                                                                                                   |
 |  81  | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii)                                                      |                                                          [![Java](assets/java.png)](src/SearchInRotatedSortedArrayII.java)                                                           |                                                                                                                                   |
+|  82  | [Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii)                                              |                                                        [![Java](assets/java.png)](src/RemoveDuplicatesFromSortedListII.java)                                                         |                                                                                                                                   |
 |  83  | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list)                                                    |                   [![Java](assets/java.png)](src/RemoveDuplicatesFromSortedList.java) [![Python](assets/python.png)](python/remove_duplicates_from_linked_list.py)                   |                                                                                                                                   |
 |  88  | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)                                                                                    |                                  [![Java](assets/java.png)](src/MergeSortedArray.java) [![Python](assets/python.png)](python/merge_sorted_array.py)                                  |                                                                                                                                   |
 |  94  | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)                                                             |                       [![Java](assets/java.png)](src/BinaryTreeInorderTraversal.java) [![Python](assets/python.png)](python/binary_tree_inorder_traversal.py)                        |                                                                                                                                   |

src/RemoveDuplicatesFromSortedListII.java

@@ -0,0 +1,31 @@
+// https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii
+// T: O(N)
+// S: O(1)
+
+public class RemoveDuplicatesFromSortedListII {
+    private static class ListNode {
+        int val;
+        ListNode next;
+    }
+
+    public ListNode deleteDuplicates(ListNode head) {
+        if (head == null) return null;
+        ListNode tempHead = new ListNode();
+        tempHead.next = head;
+        int val;
+        for (ListNode current = head, previous = tempHead ; current != null && current.next != null ; ) {
+            if (current.val == current.next.val) {
+                val = current.val;
+                while (current.next != null && current.next.val == val) {
+                    current = current.next;
+                }
+                current = current.next;
+                previous.next = current;
+            } else {
+                previous = current;
+                current = current.next;
+            }
+        }
+        return tempHead.next;
+    }
+}