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.
class Solution { public: void deleteNode(ListNode* node) { if (node == NULL) return; else if(node->next != NULL){ //只给出一个要删除的结点，转移思维，改成拷贝目标结点后结点的值，然后删除目标结点的后一结点 node->val = node->next->val; node->next = node->next->next; } else{ return; } } };
