@@ -0,0 +1,653 @@
+# Definition for singly-linked list.%0A# class ListNode:%0A#     def __init__(self, x):%0A#         self.val = x%0A#         self.next = None%0A%0Aclass Solution:%0A    # @param head, a ListNode%0A    # @return a ListNode%0A    def deleteDuplicates(self, head):%0A        if head == None: return None%0A        dic = %7B%7D%0A        pre = ListNode(0)%0A        dumpy = pre%0A        pre.next = head%0A        p = head%0A        while p != None:%0A            %0A            if p.val not in dic:%0A                dic%5Bp.val%5D = 1%0A                pre = pre.next%0A            else:%0A                pre.next = p.next%0A                %0A                %0A            p = p.next%0A        return dumpy.next%0A

Create RemoveDuplicatesfromSortedList_95.py