题目
解题
显然这是个 链 表 \color{red}{链表} 链表的题
一次删除的过程:
code:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def deleteDuplicates(self, head: ListNode) -> ListNode:
cur = head
while cur != None and cur.next != None:
if cur.val == cur.next.val:
cur.next = cur.next.next
else:
cur = cur.next
return head
结果:
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/search-insert-position
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
3.12
over