Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
Input: 1->1->2 Output: 1->2 Example 2:
Input: 1->1->2->3->3 Output: 1->2->3
My code:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def deleteDuplicates(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if head==None or head.next==None:
return head
origin_head=head
count=0
value=head.val
pre_head=head
while head!=None and head.next!=None:
if head.val==head.next.val:
while head.next!=None and head.val==head.next.val:
head=head.next
if head.val==origin_head.val:
origin_head=head
pre_head=head
continue
pre_head.next=head
pre_head=head
head=head.next
continue
pre_head=head
head=head.next
return origin_head
Solution: https://leetcode.com/problems/remove-duplicates-from-sorted-list/submissions/