leetcode-remove duplicates from sorted list

remove duplicates from sorted list

---

描述

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
Example 1:
Input: 1->2->3->3->4->4->5
Output: 1->2->5
Example 2:
Input: 1->1->1->2->3
Output: 2->3

---

解法

class Solution:
def deleteDuplicates(self, head: ‘ListNode’) -> ‘ListNode’:
dummy =ListNode(0)
dummy.next=head
pre=dummy
cur=head
while cur:
while cur.next and cur.valcur.next.val:
cur=cur.next
if pre.nextcur:
pre=cur
else:
pre.next=cur.next
cur = cur.next
return dummy.next
class ListNode:
def init(self,x):
self.val=x
self.next=None