题意: Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,
Given 1->2->3->3->4->4->5, return 1->2->5.
Given 1->1->1->2->3, return 2->3.
代码:
class Solution(object):
def deleteDuplicates(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
h = ListNode(float('-inf'))
h.next = head
p = h
while p.next and p.next.next:
if p.next.val == p.next.next.val:
q = p.next.next
while q and p.next.val == q.val:
q = q.next
p.next = q
else:
p = p.next
return h.next