给你一个链表的头节点 head 和一个整数 val ,请你删除链表中所有满足 Node.val == val 的节点,并返回 新的头节点 。
示例 1:
输入:head = [1,2,6,3,4,5,6], val = 6
输出:[1,2,3,4,5]
示例 2:
输入:head = [], val = 1
输出:[]
示例 3:
输入:head = [7,7,7,7], val = 7
输出:[]
链接:https://leetcode-cn.com/problems/remove-linked-list-elements
classSolution:
def removeElement(self,head:ListNode, val:int)->ListNode:
dummpy = ListNode(0)
dummpy.next = head
cur = dummpy
while cur is not None:
if cur.next and cur.next.val = val:
cur.next = cur.next.next
else:
cur = cur.next
return dummpy.next
Leetcode 203. 移除链表元素 (每日一题 20210914)
最新推荐文章于 2021-10-11 09:19:09 发布