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.

刚开始没想出来，原来是理解错题意了。只给你一个待删除的结点指针，不给其它信息，实现删除。而且这个结点不是最后一个结点。

思路是用下一个结点的值替代它，然后删除下一个结点。

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