Delete Node in a Linked List
Total Accepted: 1872 Total Submissions: 3662Write 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.
[CODE]
/**
* 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) {
//input check
if(node==null) return;
node.val = node.next.val;
node.next = node.next.next;
}
}
1325
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
