我的死穴——反转链表+删除链表节点

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

class Solution:
    def reverseList(self, head: ListNode) -> ListNode:
        p = head
        prev=None
        while p != None:
            later=p.next
            p.next=prev
            prev=p
            p=later

        return prev      

#非哑结点
# 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
        if p.val == val:
            head = head.next
        else:
            while p.val != val:
                prev = p
                p = p.next        
            prev.next=p.next
        return head

# 哑结点
# 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:
        ya = ListNode(val-1)
        ya.next = head
        p = ya
        while p.val != val:
            prev = p
            p = p.next        
        prev.next = p.next
        return ya.next