题目链接:https://leetcode.com/problems/remove-duplicates-from-sorted-list
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
.
# 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):
"""
:type head: ListNode
:rtype: ListNode
"""
if(head==None) or (head.next==None): return head
cur=head
while cur.next!=None and cur!=None:
if(cur.val==cur.next.val):
last=cur.next
cur.next=last.next
else:
cur=cur.next
return head