【python3】leetcode 203. Remove Linked List Elements (easy)

momottyy

于 2019-01-08 14:19:37 发布

阅读量296

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode python

本文链接：https://blog.youkuaiyun.com/maotianyi941005/article/details/86073816

leetcode 同时被 2 个专栏收录

126 篇文章

订阅专栏

python

120 篇文章

订阅专栏

本文详细解析了LeetCode上题目203——移除链表中指定值的元素的算法实现。通过实例演示了如何遍历链表并移除所有等于特定值的节点，提供了Python代码示例，包括处理头部节点特殊情况的方法。

203. Remove Linked List Elements (easy)

Remove all elements from a linked list of integers that have value val.

Example:
Input:  1->2->6->3->4->5->6, val = 6
Output: 1->2->3->4->5

先把头部为val的全过滤掉，不然pre没办法指

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def removeElements(self, head, val):
        """
        :type head: ListNode
        :type val: int
        :rtype: ListNode
        """
        if not head:return []
        while(head!=None and head.val == val):head = head.next
        if not head:return []
        pre = head  #!=val
        node = head.next
        while(node):
            if node.val == val:
                pre.next = node.next
            else:
                pre = node
            node = node.next        
                
            
        return head