题目:
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.
题目很简单,找到待删除节点的上一个节点,将其next指向待删除节点的下一个节点即可。
代码:
/**
* 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.next == null){
//处理链表只有一个节点的情况
node = null;
}else{
ListNode nextNode = node.next;
node.val = nextNode.val;
node.next = nextNode.next;
}
}
}