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.
解题思路
让当前结点的值等于下一节点的值,然后当前结点指向下一节点的下一节点,最后删除要删掉结点的下一节点。
实现代码
// Runtime: 1 ms
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public void deleteNode(ListNode node) {
node.val = node.next.val;
node.next = node.next.next;
}
}