# [Leet Code] Delete node in a linked list

Input: head = [4,5,1,9], node = 5
Output: [4,1,9]
Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
Input: head = [4,5,1,9], node = 1
Output: [4,5,9]
Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
Input: head = [1,2,3,4], node = 3
Output: [1,2,4]
Input: head = [0,1], node = 0
Output: [1]
Input: head = [-3,5,-99], node = -3
Output: [5,-99]
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def deleteNode(self, node):
"""
:type node: ListNode
:rtype: void Do not return anything, modify node in-place instead.
"""

node.val = node.next.val
if node.next.next:
node.next = node.next.next
else:
node.next = None

--

--

## More from Matthew Boyd

Learning, and posting my findings!

Love podcasts or audiobooks? Learn on the go with our new app.

## Matthew Boyd

Learning, and posting my findings!