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
.
翻译:去除链表中重复的数字
class Solution(object):
def deleteDuplicates(self, head):
p = head
while p!=None:
q = p.next
while q!=None:
if(p.val == q.val):
p.next = q.next
q = p.next
else:
break
p = q
return head