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.
Show Similar Problems
Have you met this question in a real interview?
Yes
No
代码如下:
删除参数节点,其实就是用后面的节点来覆盖前面的就行(题目中强调了除了尾节点)
/**
* 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) {
if(node == null) return;
node.val = node.next.val;
node.next = node.next.next;
}
}