237. Delete Node in a Linked List


Total Accepted: 53467 Total Submissions: 121930 Difficulty: Easy

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.

Subscribe to see which companies asked this question

删除链表的节点：刚开始题目理解错误，这题以前有个老师讲过类似的题目。

public void deleteNode(ListNode node) {

	 node.val = node.next.val;
	node.next = node.next.next;

}
问题是这里的： 

	node.next = node.next.next;
可不可以换成：
	node = node.next;
discuss 中给出了可能的原因：






















哥哥没看懂！