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

题意：

　　给定一个单向链表中的任意结点，要求将此结点从链表中删除。

思路：

　　比较巧妙，将当前结点伪装成下一个结点，然后将下一个结点删除即可。

C++：

/**
* 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 == 0)
return ;

node->val  = node->next->val;

ListNode *del = node->next;
node->next = del->next;

delete del;
}
};