See Code
注意边界问题
O(n)
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def deleteDuplicates(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
pre = cur = res = head
while cur and cur.next:
while cur.next and cur.val == cur.next.val:
cur = cur.next
pre.next = cur.next
pre = cur.next
cur = cur.next
return res