(easy)LeetCode 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 -> 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) {
        ListNode nextNode=node.next;
        node.val=nextNode.val;
        node.next=nextNode.next;
        
    }
}

　　运行结果：

(easy)LeetCode 237.Delete Node in a Linked List

原文：http://www.cnblogs.com/mlz-2019/p/4692875.html