237. Delete Node in a Linked List

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.

java实现--方法没有给出头结点，只能将本结点的下一结点的值赋值给该结点，然后删除下一结点

刚开始没想明白。。。

/**
 * 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) {
        if(node!=null){
            node.val=node.next.val;
            node.next=node.next.next;
        
           
        }
        
    }
}