【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

 

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

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