[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.

我的解法：同I copied every node.val to the one before and set the last one to null. What a shame.

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

聪明的解法：只把要删除的节点后面的那个的值赋过来，然后删除后面那个节点。
public void deleteNode(ListNode node) {
node.val = node.next.val;
node.next = node.next.next;
}