湛蓝与蔚蓝
Linked List
标题
列 1
列 2
列 3
列 4
列 5
列 6
列 7
#
Title
Solution
Time
Space
Difficulty
Tag
Note
0002
Add Two Numbers
C++ Python
O(n)
O(1)
Medium
0021
Merge Two Sorted Lists
C++ Python
O(n)
O(1)
Easy
0023
Merge k Sorted Lists
C++ Python
O(nlogk)
O(1)
Hard
Heap, Divide and Conquer
0024
Swap Nodes in Pairs
C++ Python
O(n)
O(1)
Easy
0025
Reverse Nodes in k-Group
C++ Python
O(n)
O(1)
Hard
0061
Rotate List
C++ Python
O(n)
O(1)
Medium
0082
Remove Duplicates from Sorted List II
C++ Python
O(n)
O(1)
Medium
0083
Remove Duplicates from Sorted List
C++ Python
O(n)
O(1)
Easy
0092
Reverse Linked List II
C++ Python
O(n)
O(1)
Medium
0138
Copy List with Random Pointer
C++ Python
O(n)
O(1)
Medium
0160
Intersection of Two Linked Lists
C++ Python
O(m + n)
O(1)
Easy
0203
Remove Linked List Elements
C++ Python
O(n)
O(1)
Easy
0206
Reverse Linked List
C++ Python
O(n)
O(1)
Easy
0234
Palindrome Linked List
C++ Python
O(n)
O(1)
Easy
0237
Delete Node in a Linked List
C++ Python
O(1)
O(1)
Easy
LintCode
0328
Odd Even Linked List
C++ Python
O(n)
O(1)
Medium
0369
Plus One Linked List
C++ Python
O(n)
O(1)
Medium
🔒
Two Pointers
0445
Add Two Numbers II
C++ Python
O(m + n)
O(m + n)
Medium
0708
Insert into a Sorted Circular Linked List
C++ Python
O(n)
O(1)
Medium
🔒
Linked List
0725
Split Linked List in Parts
C++ Python
O(n + k)
O(1)
Medium
0817
Linked List Components
C++ Python
O(m + n)
O(m)
Medium
0986
Interval List Intersections
C++ Python
O(m + n)
O(1)
Medium
Loading...
ran2323
ran2323
忘掉名字吧
Latest posts
SFT + DPO 塔罗解读
SFT + DPO 塔罗解读
2025-4-14
Backtracking
Backtracking
2025-4-14
Leetcode 0001-1000 分组
Leetcode 0001-1000 分组
2025-4-14
mcp 记录(1)
mcp 记录(1)
2025-4-14
DPO 相关
DPO 相关
2025-3-29
今日paper(3/25) - MAGPIE
今日paper(3/25) - MAGPIE
2025-3-27
Announcement
 
 
 
 
暂时没有新的内容