[Leetcode]237. Delete Node in a Linked List

Posted 2020-06-27

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

Solution：

将node.val置为下一个节点的val，删除下一个节点。

 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 {
10     if (node == NULL)
11         return;
12     node->val = node->next->val;
13     node->next = node->next->next;
14 }