您好,登錄后才能下訂單哦!
這篇文章主要講解了“怎么用python刪除重復(fù)的元素”,文中的講解內(nèi)容簡(jiǎn)單清晰,易于學(xué)習(xí)與理解,下面請(qǐng)大家跟著小編的思路慢慢深入,一起來(lái)研究和學(xué)習(xí)“怎么用python刪除重復(fù)的元素”吧!
題意:對(duì)給定的排好序的鏈表,刪除重復(fù)的元素,只留下出現(xiàn)一次的元素
思路:當(dāng)元素和下一個(gè)元素比對(duì),如果相同,當(dāng)前元素的next指針指向下一個(gè)元素的next指針。
Language : c
/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */struct ListNode* deleteDuplicates(struct ListNode* head) { struct ListNode* cur = (int *)malloc(sizeof(struct ListNode)); cur = head;while(cur != NULL){while(cur->next != NULL && cur->val == cur->next->val){ cur->next = cur->next->next; } cur = cur->next; }return head; }
Language : cpp
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* deleteDuplicates(ListNode* head) { ListNode* cur = head;while(cur != NULL){while(cur->next != NULL && cur->val == cur->next->val){ cur->next = cur->next->next; } cur = cur->next; } return head; } };
Language : python
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object):def deleteDuplicates(self, head):""" :type head: ListNode :rtype: ListNode """ now = headwhile head:while head.next and head.val == head.next.val: head.next = head.next.next head = head.nextreturn now
感謝各位的閱讀,以上就是“怎么用python刪除重復(fù)的元素”的內(nèi)容了,經(jīng)過(guò)本文的學(xué)習(xí)后,相信大家對(duì)怎么用python刪除重復(fù)的元素這一問(wèn)題有了更深刻的體會(huì),具體使用情況還需要大家實(shí)踐驗(yàn)證。這里是億速云,小編將為大家推送更多相關(guān)知識(shí)點(diǎn)的文章,歡迎關(guān)注!
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如果涉及侵權(quán)請(qǐng)聯(lián)系站長(zhǎng)郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。