【題目】
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.
The idea is to copy the data of next node to current node and then delete the next node.
【代碼】
/**
* 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 && node.next !=null){
node.val = node.next.val;
node.next = node.next.next;
}
}
}
爲什麼不能直接吧當前節點變成次啊一個節點?!!!