LeetCode 237. Delete Node in a Linked List C语言

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.

这到题和我们平时做的不一样，我们无法找到要被删的节点的直接前驱，所以把要删的看做被删的之前前驱；

上面有些废话，简单说就是把直接后驱的值赋给现在的节点，删除后面的节点；

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
void deleteNode(struct ListNode* node) {
     struct ListNode *t;
     t = node->next;
     node->val = t->val;
     node->next = t->next;
     free(t);
}