LeetCode打卡： 82. 删除链表中的重复元素II

给定一个排序链表，删除所有含有重复数字的节点，只保留原始链表中 没有重复出现 的数字。

示例 1:

输入: 1->2->3->3->4->4->5
输出: 1->2->5
示例 2:

输入: 1->1->1->2->3
输出: 2->3

链接：https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
我的代码：

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution(object):
    def deleteDuplicates(self, head):
        """
        :type head: ListNode
        :rtype: ListNode
        """
        if head:
            h = ListNode(-1)
            h.next = head
            head = h
            h = h.next
            pre = head
            while h and h.next:
                if h.val == h.next.val:
                    while h.next and h.val == h.next.val:
                        h = h.next
                    pre.next = h.next
                else:
                    pre = h
                h = h.next  
            head = head.next
        return head

Time: O(N)
Space:O(1)