Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.<\/p>\n
Given linked list —\u00a0head =\u00a0[4,5,1,9], which looks like following:<\/p>\n
4 -> 5 -> 1 -> 9\r\n<\/pre>\nExample 1:<\/strong><\/p>\n
Input:<\/strong> head = [4,5,1,9], node = 5\r\nOutput:<\/strong> [4,1,9]\r\nExplanation: <\/strong>You are given the second node with value 5, the linked list\r\n\u00a0 should become 4 -> 1 -> 9 after calling your function.\r\n<\/pre>\nExample 2:<\/strong><\/p>\n
Input:<\/strong> head = [4,5,1,9], node = 1\r\nOutput:<\/strong> [4,5,9]\r\nExplanation: <\/strong>You are given the third node with value 1, the linked list\r\n should become 4 -> 5 -> 9 after calling your function.\r\n<\/pre>\nNote:<\/strong><\/p>\n
\n
- The linked list will have at least two elements.<\/li>\n
- All of the nodes’ values will be unique.<\/li>\n
- The given node\u00a0will not be the tail and it will always be a valid node of the linked list.<\/li>\n
- Do not return anything from your function.<\/li>\n<\/ul>\n
Python<\/strong><\/p>\n
\r\n# Definition for singly-linked list.\r\n# class ListNode(object):\r\n# def __init__(self, x):\r\n# self.val = x\r\n# self.next = None\r\n\r\nclass Solution(object):\r\n def deleteNode(self, node):\r\n """\r\n :type node: ListNode\r\n :rtype: void Do not return anything, modify node in-place instead.\r\n """\r\n node.val = node.next.val\r\n node.next = node.next.next\r\n \r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"