Python describe LeetCode 83. Delete duplicate elements from the sort list

Hello everyone , I'm Qi Guanjie （qí guān jié ）, stay 【 Qi Guanjie 】 official account 、CSDN、GitHub、B Share some technical blog posts on the website and other platforms , It mainly includes front-end development 、python The backend development 、 Applet development 、 Data structure and algorithm 、docker、Linux Common operation and maintenance 、NLP And other related technical blog , Time flies , Future period , come on. ~

If you love bloggers, you can focus on the bloggers' official account. 【 Qi Guanjie 】(qí guān jié), The articles inside are more complete and updated faster . If you need to find a blogger, you can leave a message at the official account. , I will reply to the message as soon as possible .

---

This article was originally written as 【 Qi Guanjie 】（qí guān jié ）, Please support the original , Some platforms have been stealing blog articles maliciously ！！！ All articles please pay attention to WeChat official account 【 Qi Guanjie 】.

subject

Given the header of a sorted linked list head , Delete all duplicate elements , Make each element appear only once . return Sorted linked list .

Example 1：

 Input ：head = [1,1,2]
Output ：[1,2]

Example 2：

 Input ：head = [1,1,2,3,3]
Output ：[1,2,3]

Tips ：

• The number of nodes in the linked list is in the range [0, 300] Inside
• -100 <= Node.val <= 100
• The title data ensures that the linked list has been in ascending order array

Python describe

# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def deleteDuplicates(self, head: ListNode) -> ListNode:
tmp_head = ListNode(-1,head)
l,r = tmp_head,tmp_head.next
while r:
while r.next and r.val == r.next.val:
r = r.next
l.next = r
l = l.next
r = r.next
l.next = None
return tmp_head.next