Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.
题意:排序的链表删除重复的元素,保证每个元素出现一次
runtime:68ms
总结:val不同的,移动指针p,val相同的,指针p不变,移动p.next;
每一次比较p.next.val和p.val之前,都要先判断p.next存在与否,否则p.next=None时,p.next.val会报错
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def deleteDuplicates(self, head):
if not head or not head.next:
return head
dummy=ListNode(0)
dummy.next=head
p=head
while p.next:
if p.next.val==p.val:
p.next=p.next.next
else:
p=p.next
return dummy.next