203. 移除链表元素
给你一个链表的头节点 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
输出:[]
思路,此题的思路参考链表的介绍_以Python为例中单链表中的元素删除。
代码如下:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, val=0, next=None):
# self.val = val
# self.next = next
class Solution:
def removeElements(self, head: ListNode, val: int) -> ListNode:
# 当要删除的元素为第一个元素时
while head and head.val == val:
head = head.next
if not head:
return head
else:
cur = head
pre = None # 用于储存被删除节点的上一节点
while cur is not None: # 遍历到尾节点
if cur.val != val:
pre = cur
else:
pre.next = cur.next
cur = cur.next
return head