0
点赞
收藏
分享

微信扫一扫

21. Leetcode 203. 移除链表元素 (链表-删除链表的节点)

程序猿不脱发2 2022-01-27 阅读 149
给你一个链表的头节点 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
输出:[]


# 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:
        dummy = ListNode(0)
        dummy.next = head

        p = dummy
        while p.next != None:
            if p.next.val == val:
                p.next = p.next.next
            else:
                p = p.next

        
        return dummy.next

举报

相关推荐

0 条评论