LintCode 372: Delete Node in the Middle of Singly Linked List

Description:

Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.

Note:

1.拿到的是当前的结点，也就是说拿不到当前结点前一个结点，所以我把当前结点用下一个结点的值覆盖掉，再删掉下一个结点。

Code:

/**
* Definition of ListNode
* class ListNode {
* public:
* int val;
* ListNode *next;
* ListNode(int val) {
* this->val = val;
* this->next = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param node: a node in the list should be deleted
* @return: nothing
*/
void deleteNode(ListNode *node) {
// write your code here
if(!node||!node->next)
return;
ListNode * deleted=node->next;
node->val = deleted->val;
node->next = deleted ->next;
delete deleted;
return;
}
};