237. 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 -> 4after calling your function.

Subscribe to see which companies asked this question.

思路：可能会进入一个死胡同，就要要删除那个节点，其实只用改变那个节点的值就可以了。节点的顺序之所以是那样，是因为它值的顺序，而不是节点的顺序。

/** * Definition for singly-linked list. * public class ListNode { *     int val; *     ListNode next; *     ListNode(int x) { val = x; } * } */public class Solution {    node.val = node.next.val;   

   node.next = node.next.next;}