🥥 Table of Content
🥑 Get Started!
I. Top 8 Data Sturctures for Coding Interviews
0. Common Data Structure Operations Time Complexity
Data Structure |
Time Complexity(Worst) |
Space Complexity(Worst) |
|
Access |
Search |
Insert |
Delete |
|
Array |
O(1) |
O(n) |
O(n) |
O(n) |
O(n) |
Linked List |
|
|
|
|
|
HashMap |
|
|
|
|
|
Queue |
|
|
|
|
|
Binary Tree |
|
|
|
|
|
Tries |
|
|
|
|
|
Heap |
|
|
|
|
|
Graph |
|
|
|
|
|
1. Array
2. Linked list
3. HashMap
4. Queue
5. Binary Tree
6. Tries
7. Heap
8. Graph
II. Sort Algorithms

class Solution:
def merge(self, arr, l, m, r):
n1 = m - l + 1
n2 = r - m
L = [0] * (n1)
R = [0] * (n2)
for i in range(0, n1):
L[i] = arr[l + i]
for j in range(0, n2):
R[j] = arr[m + 1 + j]
i = 0
j = 0
k = l
while i < n1 and j < n2:
if L[i] <= R[j]:
arr[k] = L[i]
i += 1
else:
arr[k] = R[j]
j += 1
k += 1
while i < n1:
arr[k] = L[i]
i += 1
k += 1
while j < n2:
arr[k] = R[j]
j += 1
k += 1
def mergeSort(self, arr, l, r):
if l < r:
m = l + (r - l) // 2
self.mergeSort(arr, l, m)
self.mergeSort(arr, m + 1, r)
self.merge(arr, l, m, r)
if __name__ == '__main__':
arr = [12, 11, 13, 5, 6, 7]
n = len(arr)
print("给定的数组")
for i in range(n):
print("%d" % arr[i]),
solution = Solution()
result = solution.mergeSort(arr, 0, n - 1)
print("\n\n排序后的数组")
for i in range(n):
print("%d" % arr[i])
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· DeepSeek “源神”启动!「GitHub 热点速览」
· 微软正式发布.NET 10 Preview 1:开启下一代开发框架新篇章
· 我与微信审核的“相爱相杀”看个人小程序副业
· C# 集成 DeepSeek 模型实现 AI 私有化(本地部署与 API 调用教程)
· spring官宣接入deepseek,真的太香了~