LeetCode-Delete Node in a Linked List

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