Leetcode 鏈表知識點總結

來看下Leetcode中Tag爲[ Linked-List ](https://leetcode.com/tag/linked-list/ )的題目[ 141. Linked List Cycle ](https://leetcode.com/problems/linked- list-cycle / description / ):判斷一個鏈表是否存在環,Easy [ 142.鏈接列表循環II ](https://leetcode.com/problems/linked-list-cycle-ii/description/ ):求帶環鏈表的入口結點,中等[ 83.從排序列表中刪除重複](https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/ ):從排序鏈表中刪除重複的元素重複元素保留一個),Easy [82。從分類列表中刪除重複項II](

https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/ ):從排序鏈表中刪除重複的元素(重複元素一個也不留),Medium [ 237. Delete Node in鏈接列表](https://leetcode.com/problems/delete-node-in-a-linked-list/description/ ):從鏈表中刪除一個結點,輕鬆 [ 203.刪除鏈接列表元素](https ://leetcode.com/problems/remove-linked-list-elements/description/ ):從鏈表中刪除一個元素,Easy [ 206.反向鏈接列表](https://leetcode.com/problems/reverse-linked -list / description / ):鏈表轉置,Easy[92。反向鏈接列表II]( https://leetcode.com/problems/reverse-linked-list-ii/description/

):從m到n的位置轉置,其他位置保持不變,Medium [ 21.合併兩個排序列表](https ://leetcode.com/problems/merge-two-sorted-lists/description/ ):融合兩個有序鏈表,Easy [ 23.合併k排序列表](https://leetcode.com/problems/merge-k-sorted-lists / description /):融合K個有序鏈表,Hard [2.添加兩個數字](https://leetcode.com/problems/add-two-numbers/description/):求兩鏈表的容易[445.添加兩個數字II](https://leetcode.com/problems/add-two-numbers-ii/description/):要求不翻轉鏈表,實現兩鏈表的和,Medium [ 24 。交換節點在對](https://leetcode.com/problems/swap-nodes-in-pairs/description/ ):兩兩交換鏈表結點,中等[25。k組中的反向節點](https://leetcode.com/problems/reverse-nodes-in-k-group/description/):以k個結點爲一組進行鏈表結點的交換,Hard [61 。[旋轉列表](https://leetcode.com/problems/rotate-list/description/):向右向旋轉數組K,Medium [19.從列表結束刪除第N個節點](

https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/ ):刪除倒數第n個結點,中等 [ 725.拆分鏈接列表中的部分](https://leetcode.com/problems/split-linked-list-in-parts/description/ ):將鏈表拆成K個鏈表,每個鏈表之間長度差不能超過1,中等 [ 86.分區列表](https://leetcode.com/problems/partition-list/description/ ):將鏈表整理成小於X->大於等於X的鏈表形式,保持原來的相對位置不變,中 [

  1. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/description/):將鏈表改寫成二叉平衡搜索樹格式,Medium
    143. Reorder List:將L1->L2->…->Ln-1-> Ln鏈表改寫成L1->Ln->L2->Ln-1->…,Medium
    [234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/description/ ):判斷一個鏈表是不是迴文鏈表,Easy [ 138.用隨機指針複製列表](https://leetcode.com/拷貝帶有隨機指針 /描述/ ):拷貝帶有隨機指針的鏈表,中 [ 147.插入排序列表](https://leetcode.com/problems/insertion-sort-list/description / ):使用直接插入排序將鏈表整理成有序鏈表,中 [ 148.排序列表](https://leetcode.com/problems/sort-list/description/ ):用常量空間和O(nlogn)來將鏈表整理成有序鏈表,中 [ 160.兩個鏈接列表的交集](

https://leetcode.com/problems/intersection-of-two-linked-lists/description/ ):找出兩個鏈表的公共結點,中 [ 328.奇數鏈表](https:// leetcode。 com / problems / odd-even-linked-list / description / ):將鏈表改寫成奇結點+偶結點鏈表,中Github答案鏈接(Python) [ 鏈表解決方案](https://github.com/ tinkle1129 / Leetcode_Solution / tree / master / LinkedList )

發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章