# LeetCode237:Delete Node in a Linked List

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.

/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
public class Solution {
public void deleteNode(ListNode node) {
if(node==null)
return;
if(node.next==null)
node=null;
node.val=node.next.val;
node.next=node.next.next;
}
}

• 本文已收录于以下专栏：

## LeetCode之路：237. Delete Node in a Linked List

LeetCode之路：237. Delete Node in a Linked List 一、引言这道题 哈哈哈 这是我做完了之后看到最高票答案的标题，顿时觉得有些滑稽：）那么接下来就让我们看看这...

## 【LeetCode】 Delete Node in a Linked List

Delete Node in a Linked List  Total Accepted: 1872 Total Submissions: 3662 Write a...