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.
1 /**
2 * Definition for singly-linked list.
3 * struct ListNode {
4 * int val;
5 * struct ListNode *next;
6 * };
7 */
8 void deleteNode(struct ListNode* node) {
9 if(node == NULL || node->next == NULL)
10 return;
11 node->val = node->next->val; //把下一节点值赋予删除当前节点
12 node->next = node->next->next; //删除下一个节点
13 }