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) {
if(node.next == null){
return;
}else{
node.val=node.next.val;
node.next=node.next.next;
}
}
}
总结:仔细读题目,其实我第一次没读懂- -,看了别人的才反应过来,题目的意思是,有一个单链表,给你一个链表内的节点,让你把这个节点删掉,那就删好咯- -,很简单。