菜鸡刷leetcode 剑指 Offer 18. 删除链表的节点

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    def deleteNode(self, head: ListNode, val: int) -> ListNode:
        p = head
        while p.next != None:
            if p.val == val:
                head = head.next
                p.next = None
            elif p.next.val == val:
                p.next = p.next.next
            else:
                p = p.next
        return head                

注意：删除链表里target节点，注意头节点删的时候别整个删没了。。。。