82. 删除排序链表中的重复元素 II

解

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def deleteDuplicates(self, head: ListNode) -> ListNode:
        
        if not head or not head.next:
            return head
        
        pre = None
        cur = head
        while cur and cur.next:
            
            # 重复
            if cur.val == cur.next.val:
                
                # 出现重复元素 更新cur到重复元素的最后一个位置
                while cur.next and cur.val == cur.next.val:
                    cur = cur.next

                # 删除重复元素
                if not pre:
                    # 重复元素在头部
                    head = cur.next
                    cur = cur.next
                else:
                    # 重复元素不在头部
                    pre.next = cur.next
                    cur = cur.next
                
            # 不重复
            else:
                pre = cur
                cur = cur.next
                
        return head