面試題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:
        hh = ListNode(-1)
        hh.next = head
        head = hh
        p = hh.next
        while p:
            if p.val == val:
                hh.next = p.next
                break
            hh = p
            p = p.next
        return head.next