题目描述:
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.
就是告诉你你要删除的node,让你把他从list中删除。
一开始我觉得自己是不是理解错意思了,没告诉你头结点,应该是没法把当前node删除的呀,因为你无法得到上一节点 的指针。
但是其实只需要假装“删除”就行了,也就是change the value!
代码如下:
/**
* 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;
node.next=node.next.next;
}
}