#-*- coding: UTF-8 -*-
# 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):
if head==None or head.next==None:return head
pre=head
cur=head.next
while cur!=None:
if pre.val!=cur.val:
pre=cur
cur=cur.next
continue
while cur.next!=None and cur.next.val==pre.val:
cur=cur.next
pre.next=cur.next
cur=pre.next
return head
相关文章
- 02-24leetcode — remove-duplicates-from-sorted-list
- 02-24LeetCode-Easy-Remove Duplicates from Sorted Array
- 02-24【leetcode】Remove Duplicates from Sorted List (easy)
- 02-24LeetCode OJ:Remove Duplicates from Sorted List II(链表去重II)
- 02-24【leetcode❤python】83. Remove Duplicates from Sorted List
- 02-24【leetcode❤python】 19. Remove Nth Node From End of List
- 02-24【leetcode❤python】26. Remove Duplicates from Sorted Array
- 02-24leetcode83_Remove Duplicates from Sorted List
- 02-2448. Remove Duplicates from Sorted List && Remove Duplicates from Sorted List II
- 02-24LeetCode之“链表”:Remove Duplicates from Sorted List && Remove Duplicates from Sorted List II