题目:
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; }
* }
*/
分析:
这是一个单链表问题。由于只能访问当前节点,因此不能够完全删除当前节点(无法访问上一节点,上一节点的next关系无法改变),因此可考虑将当前节点的下一节点的值赋给当前节点。
解法:
class Solution {
public void deleteNode(ListNode node) {
node.val=node.next.val;
node.next=node.next.next;
}
}