Remove duplicates from Sorted List Leetcode Python

Given a sorted linked list, delete all duplicates such this each element appear only once.


For example,
Given 1->1->2, return 1->2.

Given 1->1->2->3->3, return 1->2->3.

Define a pre and cur

1. Pre.next=cur Pre=pre.next when both are not equal

2. Pre.next=cur.next when equal

3. Every step is Cur=cur.next

The code is as follows:

# Definition for singly-linked list.# class listnode:#     def __init__ (self, x): #         self.val = x#         Self.next = Nonec Lass Solution:    # @param head, a listnode    # @return a listnode    def deleteduplicates (self, head):        if head== None or Head.next==none:            return head        dummy=listnode (0)        dummy.next=head        pre=dummy.next        cur= Dummy.next while        cur:            if pre.val!=cur.val:                pre.next=cur                pre=pre.next            Else:                Pre.next=cur.next            Cur=cur.next        return Dummy.next

Remove duplicates from Sorted List Leetcode Python