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 -> 4after 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 = *node->next;    }};有些解答里提到最好清除next指针
void deleteNode(ListNode* node) {        struct ListNode *next = node->next;        *node = *next;        delete next; }