[LeetCode]237. Delete Node in a Linked List

https://leetcode.com/problems/delete-node-in-a-linked-list/description/

题目描述：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; }
  }

 //Since we couldn't enter the preceding node, we can not delete the given node. We can just copy the next node to the given node and //delete the next one.
public class Solution {
    public void deleteNode(ListNode node) {
        //将这个节点后一个节点的值赋给该节点
        node.val=node.next.val;
        //删除后一个节点
        node.next=node.next.next;
    }
}