題目：
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.題目大意：
編寫一個函數(shù)來刪除單鏈表中的節(jié)點（尾部除外），只允許訪問該節(jié)點。
假設(shè)鏈表是1 -> 2 -> 3 -> 4和你被賦予第三個節(jié)點的值3社搅，鏈表應(yīng)該1 -> 2 -> 4在調(diào)用你的函數(shù)后。
解題思路
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void deleteNode(ListNode* node) {
if (node->next == NULL)
{
return ;
}
node->val = node->next->val;
node->next = node->next->next;
}
};
