//本文內容來自StarSight,歡迎訪問。
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.
/**
* 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;
if(node.next.next!=null)
node.next = node.next.next;
else
node.next = null;
}
}
剛開始題目沒有看懂,給出的節點是要刪除的節點,因此我們直接把下一個節點的信息移到這一個節點,刪除下一個節點即可。