题目描述:
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.
class ListNode {
int val;
ListNode next;
ListNode(int x) { val = x; }
}
思路:
将node结点底下一个结点的值复制进node,删除node结点的下一个结点。
class Solution {
public void deleteNode(ListNode node) {
node.val = node.next.val;
node.next = node.next.next;
}
}