【4_237】Delete Node in a Linked List

Delete Node in a Linked List

Total Accepted: 48121 Total Submissions: 109297 Difficulty: Easy

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.

Subscribe to see which companies asked this question

不容易自己写对一道题，没有查找答案~

 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    struct ListNode* p = node->next;
10     node->val = p->val;
11     if (p->next == NULL)
12         node->next = NULL;
13     else
14         node->next = p->next;
15     free(p);
16 }