LeetCode OJ：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.

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9
10 class Solution {
11 public:
12     void deleteNode(ListNode* node) {
13         if(node == NULL) return;
14         node->val = node->next->val;
15         node->next = node->next->next;
16     }
17 };