Title: Delete Node in a Linked List Source: leetcode.com
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Suppose the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.
Python solution
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
''' https://leetcode.com/problems/delete-node-in-a-linked-list/ ''' # 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. """ nxt = node.next node.val = nxt.val node.next = nxt.next nxt.next = None |