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.

描述

此题是给了一个单向链表，以及一个节点，要求是删除此节点。

只需要将此节点的值修改为下一个节点的值，同时在删除下一个节点，将此节点的next指向next的next

代码

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