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.

最简单的思路，让node替代node->next，但我发现效率不算高，网上查了查其他解法。

1,

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

2,*node = *(node->next);

3,memcpy(node, node -> next, sizeof(ListNode));

但是这些仍然达不到12ms，有懂得吗？

另，如果你在前面加了注释，你的时间可能会翻倍