题目:
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Supposed 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.
替换value。
C++版:
class Solution {
public:
void deleteNode(ListNode* node) {
if(node == NULL)
return;
node->val = node->next->val;
node->next = node->next->next;
}
};
Java版:
public class Solution {
public void deleteNode(ListNode node) {
if(node == null)
return;
node.val = node.next.val;
node.next = node.next.next;
}
}
Python版:
class Solution:
# @param {ListNode} node
# @return {void} Do not return anything, modify node in-place instead.
def deleteNode(self, node):
if node == None:
return
node.val = node.next.val
node.next = node.next.next