您好,登錄后才能下訂單哦!
237. Delete Node in a Linked List
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.
題意:
刪除鏈表指定節(jié)點。前提是只傳刪除節(jié)點給函數(shù)。但不包括刪除尾節(jié)點。
思路:
由于沒有鏈表前節(jié)點的存在,所以刪除鏈表時無法改變前節(jié)點的指向。但是鏈表值是int型的,所有可以把當前節(jié)點的val和下個節(jié)點的val交換。然后刪除下個節(jié)點即可。
/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ void deleteNode(struct ListNode* node) { if ( node->next == NULL ) { return; } int tmp = 0; tmp = node->val; node->val = node->next->val; node->next->val = tmp; struct ListNode *list = node->next; node->next = node->next->next; free(list); }
免責聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點不代表本網(wǎng)站立場,如果涉及侵權(quán)請聯(lián)系站長郵箱:is@yisu.com進行舉報,并提供相關(guān)證據(jù),一經(jīng)查實,將立刻刪除涉嫌侵權(quán)內(nèi)容。