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.

实现代码贴上

class Solution {
public:
    void deleteNode(ListNode* node) {
		node->val = node->next->val;
		ListNode* p = node->next;
		node->next = node->next->next;
		free(p);
    }
};