鏈接：https://leetcode.com/problems/delete-node-in-a-linked-list/
原題:
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.
分析:這道題感覺(jué)就是個(gè)指針的問(wèn)題~
/**
* 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){
return;
}
ListNode next = node.next;
node.val = next.val;
node.next = next.next;
return;
}
}
