# 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:
        if head.val == val:
            head = head.next
        elif head.next.val == val:
            head.next = head.next.next
        else:
            self.deleteNode(head.next, val)
        return head

class Solution:
    def deleteNode(self, head: ListNode, val: int) -> ListNode:
        cur = head
        if cur.val == val:
            return cur.next
        while cur.next:
            if cur.next.val == val:
                cur.next = cur.next.next
                return head
            else:
                cur = cur.next