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.

我表示没有看懂这道题目，你要删除某一个结点，为什么在函数参数会少了一个参数，该参数告诉你要删除哪一个结点。所以。。。。。

AC：

/**
* 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) {
*node=*node->next;
}
};