-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcatalog.html
More file actions
148 lines (128 loc) · 45.1 KB
/
Copy pathcatalog.html
File metadata and controls
148 lines (128 loc) · 45.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
<!DOCTYPE html>
<html lang="zh-CN">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>算法目录</title>
<style>
* {
margin: 0;
padding: 0;
box-sizing: border-box;
}
body {
font-family: -apple-system, BlinkMacSystemFont, 'Segoe UI', 'Roboto', 'Oxygen', 'Ubuntu', 'Cantarell', 'Fira Sans', 'Droid Sans', 'Helvetica Neue', sans-serif;
background: linear-gradient(135deg, #667eea 0%, #764ba2 100%);
min-height: 100vh;
padding: 40px 20px;
}
.container {
max-width: 1200px;
margin: 0 auto;
background: white;
border-radius: 20px;
box-shadow: 0 20px 60px rgba(0, 0, 0, 0.3);
padding: 40px;
}
.header {
text-align: center;
margin-bottom: 50px;
border-bottom: 3px solid #667eea;
padding-bottom: 30px;
}
.header h1 {
font-size: 2.5rem;
color: #333;
margin-bottom: 10px;
}
.header p {
color: #666;
font-size: 1.1rem;
}
.category {
margin-bottom: 30px;
padding: 20px;
background: #f8f9fa;
border-radius: 12px;
border-left: 5px solid #667eea;
}
.category-title {
color: #667eea;
margin-bottom: 20px;
font-size: 1.5rem;
}
.file-list {
list-style: none;
}
.file-item {
padding: 12px 16px;
margin: 8px 0;
background: white;
border-radius: 8px;
display: flex;
justify-content: space-between;
align-items: center;
transition: all 0.3s ease;
box-shadow: 0 2px 4px rgba(0, 0, 0, 0.05);
}
.file-item:hover {
transform: translateX(5px);
box-shadow: 0 4px 12px rgba(0, 0, 0, 0.1);
}
.file-name {
font-size: 1rem;
color: #333;
font-weight: 500;
}
.file-link {
text-decoration: none;
color: #667eea;
font-size: 0.9rem;
padding: 5px 12px;
border: 1px solid #667eea;
border-radius: 5px;
transition: all 0.3s ease;
}
.file-link:hover {
background: #667eea;
color: white;
}
.footer {
text-align: center;
margin-top: 40px;
padding-top: 30px;
border-top: 1px solid #eee;
color: #666;
}
@media (max-width: 768px) {
.container {
padding: 20px;
}
.header h1 {
font-size: 1.8rem;
}
.file-item {
flex-direction: column;
align-items: flex-start;
gap: 8px;
}
.file-link {
align-self: flex-start;
}
}
</style>
</head>
<body>
<div class="container">
<div class="header">
<h1>📚 算法目录</h1>
<p>系统化算法学习指南</p>
</div>
<div class="category"><h2 class="category-title">📂 1.数组</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.二分查找</span><a href="https://leetcode.cn/problems/binary-search/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.移除元素</span><a href="https://leetcode.cn/problems/remove-element/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.有序数组的平方</span><a href="https://leetcode.cn/problems/squares-of-a-sorted-array/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.长度最小的子数组</span><a href="https://leetcode.cn/problems/minimum-size-subarray-sum/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.螺旋矩阵2</span><a href="https://leetcode.cn/problems/spiral-matrix-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.和为k的子数组</span><a href="https://leetcode.cn/problems/subarray-sum-equals-k/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 7.除数组以外的数组乘积</span><a href="https://leetcode.cn/problems/product-of-array-except-self/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 2.链表</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.移除链表元素</span><a href="https://leetcode.cn/problems/remove-linked-list-elements/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.设计链表</span><a href="https://leetcode.cn/problems/design-linked-list/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.反转链表</span><a href="https://leetcode.cn/problesms/reverse-linked-list/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.两两交换链表中的节点</span><a href="https://leetcode.cn/problems/swap-nodes-in-pairs/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.删除链表的倒数第n个节点</span><a href="https://leetcode.cn/problems/remove-nth-node-from-end-of-list/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.链表相交</span><a href="https://leetcode.cn/problems/intersection-of-two-linked-lists-lcci/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 7.环形链表</span><a href="https://leetcode.cn/problems/linked-list-cycle-ii/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 8.判断链表是否有环</span><a href="https://leetcode.cn/problems/linked-list-cycle/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 9.合并两个有序链表</span><a href="https://leetcode.cn/problems/merge-two-sorted-lists/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 10.合并k个有序链表</span><a href="https://leetcode.cn/problems/merge-k-sorted-lists/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 11.反转k个一组链表</span><a href="https://leetcode.cn/problems/reverse-nodes-in-k-group/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 12.排序链表</span><a href="https://leetcode.cn/problems/sort-list/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 3.哈希表</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.有效的字母异位词</span><a href="https://leetcode.cn/problems/valid-anagram/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.两个数组的交集</span><a href="https://leetcode.cn/problems/intersection-of-two-arrays/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.快乐数</span><a href="https://leetcode.cn/problems/happy-number/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.两数之和</span><a href="https://leetcode.cn/problems/two-sum/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.四数之和</span><a href="https://leetcode.cn/problems/4sum-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.赎金信</span><a href="https://leetcode.cn/problems/ransom-note/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 7.三数之和</span><a href="https://leetcode.cn/problems/3sum/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 8.四数之和</span><a href="https://leetcode.cn/problems/4sum/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 9.字符异位词分组</span><a href="https://leetcode.cn/problems/group-anagrams/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 10.最长连续序列</span><a href="https://leetcode.cn/problems/longest-consecutive-sequence/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 4.字符串</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.反转字符串</span><a href="https://leetcode.cn/problems/reverse-string/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.反转字符串二</span><a href="https://leetcode.cn/problems/reverse-string-ii/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.反转字符串中的单词</span><a href="https://leetcode.cn/problems/reverse-words-in-a-string/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.实现strStr()</span><a href="https://leetcode.cn/problems/find-the-index-of-the-first-occurrence-in-a-string/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.重复的子字符串</span><a href="https://leetcode.cn/problems/repeated-substring-pattern/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.字符串压缩</span><a href="https://leetcode.cn/problems/string-compression/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 7.无重复字符的最长子串</span><a href="https://leetcode.cn/problems/longest-substring-without-repeating-characters/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 8.找到字符串所有字母异味词</span><a href="https://leetcode.cn/problems/find-all-anagrams-in-a-string/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 9.最小覆盖子串</span><a href="https://leetcode.cn/problems/minimum-window-substring/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 10.字符串解码</span><a href="https://leetcode.cn/problems/decode-string/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 5.栈与队列</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.用栈实现队列</span><a href="https://leetcode.cn/problems/implement-queue-using-stacks/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.用队列实现栈</span><a href="https://leetcode.cn/problems/implement-stack-using-queues/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.有效的括号</span><a href="https://leetcode.cn/problems/valid-parentheses/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.删除字符串中的所有相邻重复项</span><a href="https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.逆波兰表达式求值</span><a href="https://leetcode.cn/problems/evaluate-reverse-polish-notation/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.滑动窗口求最大值.todo</span><a href="https://leetcode.cn/problems/sliding-window-maximum/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 7.前k个高频元素.todo</span><a href="https://leetcode.cn/problems/top-k-frequent-elements/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 8.移除无效的括号</span><a href="https://leetcode.cn/problems/minimum-remove-to-make-valid-parentheses/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 9.删除无效的括号</span><a href="https://leetcode.cn/problems/remove-invalid-parentheses/description/" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 6.二叉树</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.二叉树的递归遍历</span><a href="https://leetcode.cn/problems/binary-tree-preorder-traversal/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.二叉树的迭代遍历</span><a href="url是1中的" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.二叉树的层序遍历</span><a href="https://leetcode.cn/problems/binary-tree-level-order-traversal/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.翻转二叉树</span><a href="https://leetcode.cn/problems/invert-binary-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.对称二叉树</span><a href="https://leetcode.cn/problems/symmetric-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.二叉树的最大深度</span><a href="https://leetcode.cn/problems/maximum-depth-of-binary-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 7.二叉树的最小深度</span><a href="https://leetcode.cn/problems/minimum-depth-of-binary-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 8.完全二叉树的节点个数</span><a href="https://leetcode.cn/problems/count-complete-tree-nodes/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 9.平衡二叉树</span><a href="https://leetcode.cn/problems/balanced-binary-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 10.二叉树的所有路径</span><a href="https://leetcode.cn/problems/binary-tree-paths/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 11.左叶子之和</span><a href="https://leetcode.cn/problems/sum-of-left-leaves/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 12.找树左下角的值</span><a href="https://leetcode.cn/problems/find-bottom-left-tree-value/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 13.路径总和</span><a href="https://leetcode.cn/problems/path-sum/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 14.从中序与后序遍历序列构造二叉树</span><a href="https://leetcode.cn/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 15.最大二叉树</span><a href="https://leetcode.cn/problems/maximum-binary-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 16.合并二叉树</span><a href="https://leetcode.cn/problems/merge-two-binary-trees/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 17.二叉搜索树的搜索</span><a href="https://leetcode.cn/problems/search-in-a-binary-search-tree/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 18.验证二叉搜索树</span><a href="https://leetcode.cn/problems/validate-binary-search-tree/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 19.二叉搜索树的最小绝对值差</span><a href="https://leetcode.cn/problems/minimum-absolute-difference-in-bst/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 20.二叉搜索树的众数</span><a href="https://leetcode.cn/problems/find-mode-in-binary-search-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 21.二叉树的最近公共祖先</span><a href="https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 22.二叉搜索树的最近公共祖先</span><a href="https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 23.二叉搜索树的插入操作</span><a href="https://leetcode.cn/problems/insert-into-a-binary-search-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 24.删除二叉搜索树的节点</span><a href="https://leetcode.cn/problems/delete-node-in-a-bst/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 25.修剪二叉搜素树</span><a href="https://leetcode.cn/problems/trim-a-binary-search-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 26.将有序数组转换为二叉搜索树</span><a href="https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 27.把二叉搜索树转换为累加树</span><a href="https://leetcode.cn/problems/convert-bst-to-greater-tree/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 28.二叉树的直径</span><a href="https://leetcode.cn/problems/diameter-of-binary-tree/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 29.路径总和3</span><a href="https://leetcode.cn/problems/path-sum-iii/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 7.回溯算法</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.组合</span><a href="https://leetcode.cn/problems/combinations/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.组合总和三</span><a href="https://leetcode.cn/problems/combination-sum-iii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.电话号码的字母组合</span><a href="https://leetcode.cn/problems/letter-combinations-of-a-phone-number/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.组合总和</span><a href="https://leetcode.cn/problems/combination-sum/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.组合总和2</span><a href="https://leetcode.cn/problems/combination-sum-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.分割回文串</span><a href="https://leetcode.cn/problems/palindrome-partitioning/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 7.复原ip地址</span><a href="https://leetcode.cn/problems/restore-ip-addresses/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 8.子集</span><a href="https://leetcode.cn/problems/subsets/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 9.子集二</span><a href="https://leetcode.cn/problems/subsets-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 10.非递减子序列</span><a href="https://leetcode.cn/problems/non-decreasing-subsequences/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 11.全排列</span><a href="https://leetcode.cn/problems/permutations/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 12.全排列二</span><a href="https://leetcode.cn/problems/permutations-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 13.N皇后</span><a href="https://leetcode.cn/problems/n-queens/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 14.单词搜索</span><a href="https://leetcode.cn/problems/word-search/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 8.动态规划</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.斐波那契数</span><a href="https://leetcode.cn/problems/fibonacci-number/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.爬楼梯</span><a href="https://leetcode.cn/problems/climbing-stairs/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.使用最小花费爬楼梯</span><a href="https://leetcode.cn/problems/min-cost-climbing-stairs/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.不同路径</span><a href="https://leetcode.cn/problems/unique-paths/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.不同路径2</span><a href="https://leetcode.cn/problems/unique-paths-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.整数拆分</span><a href="https://leetcode.cn/problems/integer-break/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 7.不同的二叉搜索树</span><a href="https://leetcode.cn/problems/unique-binary-search-trees/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 9.分割等和子集</span><a href="https://leetcode.cn/problems/partition-equal-subset-sum/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 10.最后一块石头的重量 II</span><a href="https://leetcode.cn/problems/last-stone-weight-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 11.目标和</span><a href="https://leetcode.cn/problems/target-sum/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 12.一和零</span><a href="https://leetcode.cn/problems/ones-and-zeroes/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 14.零钱兑换二</span><a href="https://leetcode.cn/problems/coin-change-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 15.组合总和四</span><a href="https://leetcode.cn/problems/combination-sum-iv/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 16.零钱兑换</span><a href="https://leetcode.cn/problems/coin-change/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 17.完全平方数</span><a href="https://leetcode.cn/problems/perfect-squares/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 18.单词拆分</span><a href="https://leetcode.cn/problems/word-break/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 19.打家劫舍</span><a href="https://leetcode.cn/problems/house-robber/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 20.打家劫舍二</span><a href="https://leetcode.cn/problems/house-robber-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 21.打家劫舍三</span><a href="https://leetcode.cn/problems/house-robber-iii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 22.买卖股票的最佳时机</span><a href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 23.买股票的最佳时机二</span><a href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 24.买股票的最佳时机三</span><a href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 25.买股票的最佳时机四</span><a href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 26.买卖股票的最佳时机含冷冻期</span><a href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 27.买卖股票的最佳时机含手续费</span><a href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 28.最长递增子序列</span><a href="https://leetcode.cn/problems/longest-increasing-subsequence/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 29.最长连续递增子序列</span><a href="https://leetcode.cn/problems/longest-continuous-increasing-subsequence/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 30.最长重复子数组</span><a href="https://leetcode.cn/problems/maximum-length-of-repeated-subarray/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 31.最长公共子序列</span><a href="https://leetcode.cn/problems/longest-common-subsequence/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 32.数组最大乘积</span><a href="https://leetcode.cn/problems/maximum-product-subarray/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 32.最大子数组和</span><a href="https://leetcode.cn/problems/maximum-subarray/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 33.判断子序列</span><a href="https://leetcode.cn/problems/is-subsequence/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 34.不同的子序列</span><a href="https://leetcode.cn/problems/distinct-subsequences/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 35.两个字符串的删除操作</span><a href="https://leetcode.cn/problems/delete-operation-for-two-strings/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 36.编辑距离</span><a href="https://leetcode.cn/problems/edit-distance/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 37.回文子串</span><a href="https://leetcode.cn/problems/palindromic-substrings/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 38.最长回文子序列</span><a href="https://leetcode.cn/problems/longest-palindromic-subsequence/description/" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 9.贪心算法</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.分发饼干</span><a href="https://leetcode.cn/problems/assign-cookies/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.摆动序列</span><a href="https://leetcode.cn/problems/wiggle-subsequence/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.最大子数组和</span><a href="https://leetcode.cn/problems/maximum-subarray/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.买卖股票的最佳时机 II</span><a href="https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.跳跃游戏</span><a href="https://leetcode.cn/problems/jump-game/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.跳跃游戏2</span><a href="https://leetcode.cn/problems/jump-game-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 7.k次取反化后最大化的数组和</span><a href="https://leetcode.cn/problems/maximize-sum-of-array-after-k-negations/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 8.加油站</span><a href="https://leetcode.cn/problems/gas-station/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 9.分发糖果</span><a href="https://leetcode.cn/problems/candy/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 10.柠檬水找零</span><a href="https://leetcode.cn/problems/lemonade-change/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 11.根据身高重建队列</span><a href="https://leetcode.cn/problems/queue-reconstruction-by-height/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 12.用最小数量的箭引爆气球</span><a href="https://leetcode.cn/problems/minimum-number-of-arrows-to-burst-balloons/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 13.无重叠区间</span><a href="https://leetcode.cn/problems/non-overlapping-intervals/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 14.划分字母区间</span><a href="https://leetcode.cn/problems/partition-labels/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 15.合并区间</span><a href="https://leetcode.cn/problems/merge-intervals/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 16.单调递增的数字</span><a href="https://leetcode.cn/problems/monotone-increasing-digits/description/" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 10.前端相关手写</h2><ul class="file-list"><li class="directory-item"><div class="category"><h3 class="category-title">📂 1.实现js原生方法</h3><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.filter</span></li><li class="file-item"><span class="file-name">📄 2.flat</span></li><li class="file-item"><span class="file-name">📄 3.forEach</span></li><li class="file-item"><span class="file-name">📄 4.map</span></li><li class="file-item"><span class="file-name">📄 5.reduce</span></li><li class="file-item"><span class="file-name">📄 6.fill</span></li><li class="file-item"><span class="file-name">📄 7.includes</span></li><li class="file-item"><span class="file-name">📄 8.push</span></li><li class="file-item"><span class="file-name">📄 9.unshift</span></li><li class="file-item"><span class="file-name">📄 10.getLeval</span></li><li class="file-item"><span class="file-name">📄 11.interator</span></li><li class="file-item"><span class="file-name">📄 12.sort.TODO</span></li><li class="file-item"><span class="file-name">📄 13.Set</span></li><li class="file-item"><span class="file-name">📄 14.Map</span></li><li class="file-item"><span class="file-name">📄 15.assign</span></li><li class="file-item"><span class="file-name">📄 16.is</span></li><li class="file-item"><span class="file-name">📄 17.json.stringify.TODO</span></li><li class="file-item"><span class="file-name">📄 18.json.parse.TODO</span></li><li class="file-item"><span class="file-name">📄 19.call bind apply</span></li><li class="file-item"><span class="file-name">📄 20.typeof</span></li><li class="file-item"><span class="file-name">📄 21.instanceof</span></li><li class="file-item"><span class="file-name">📄 22.new</span></li><li class="file-item"><span class="file-name">📄 23.trim</span></li><li class="file-item"><span class="file-name">📄 24.groupBy</span><a href="https://developer.mozilla.org/zh-CN/docs/Web/JavaScript/Reference/Global_Objects/Object/groupBy" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div></li><li class="directory-item"><div class="category"><h3 class="category-title">📂 2.实现Promise相关</h3><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.all</span></li><li class="file-item"><span class="file-name">📄 2.finally</span></li><li class="file-item"><span class="file-name">📄 3.allSettled</span></li><li class="file-item"><span class="file-name">📄 4.race</span></li><li class="file-item"><span class="file-name">📄 5.catch</span></li><li class="file-item"><span class="file-name">📄 6.resolve</span></li><li class="file-item"><span class="file-name">📄 7.reject</span></li></ul></div></li><li class="directory-item"><div class="category"><h3 class="category-title">📂 3.Promise场景题</h3><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.交通灯</span></li><li class="file-item"><span class="file-name">📄 2.封装一个fetch请求</span></li><li class="file-item"><span class="file-name">📄 3.重复执行函数</span></li><li class="file-item"><span class="file-name">📄 4.网络请求时间限制</span></li><li class="file-item"><span class="file-name">📄 5.请求5s未完成就终止</span><a href="https://juejin.cn/post/7112699475327615006" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.实现一个sleep函数</span></li><li class="file-item"><span class="file-name">📄 7.setTime实现setInterval</span></li><li class="file-item"><span class="file-name">📄 8.奇怪的输出题</span></li><li class="file-item"><span class="file-name">📄 10.封装ajax请求</span></li><li class="file-item"><span class="file-name">📄 11.setInterval模拟setTimeOut</span></li><li class="file-item"><span class="file-name">📄 12.promise如何中断后面的then</span></li><li class="file-item"><span class="file-name">📄 13.实现一个精准的计时器</span></li><li class="file-item"><span class="file-name">📄 14.一次处理2个任务</span></li><li class="file-item"><span class="file-name">📄 15.设计一个简单的任务队列</span></li><li class="file-item"><span class="file-name">📄 16.实现调度器</span></li><li class="file-item"><span class="file-name">📄 17.有并发限制的promiseall</span></li><li class="file-item"><span class="file-name">📄 18.实现错误重新请求，并控制重试次数</span></li></ul></div></li><li class="directory-item"><div class="category"><h3 class="category-title">📂 4.js常考手写题</h3><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.LRU缓存</span><a href="https://leetcode.cn/problems/lru-cache/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.数组转树</span></li><li class="file-item"><span class="file-name">📄 3.树转数组</span></li><li class="file-item"><span class="file-name">📄 4.函数科里化</span></li><li class="file-item"><span class="file-name">📄 5.继承的几种方法</span></li><li class="file-item"><span class="file-name">📄 6.生成唯一id</span></li><li class="file-item"><span class="file-name">📄 7.十进制转十六进制</span></li><li class="file-item"><span class="file-name">📄 8.最小堆</span></li><li class="file-item"><span class="file-name">📄 9.抽奖算法</span></li><li class="file-item"><span class="file-name">📄 10.打乱数组</span></li><li class="file-item"><span class="file-name">📄 11.文件路径转换</span></li><li class="file-item"><span class="file-name">📄 12.对象路径字符串</span></li><li class="file-item"><span class="file-name">📄 13.快速选择算法</span></li><li class="file-item"><span class="file-name">📄 14.对象字符串</span></li><li class="file-item"><span class="file-name">📄 15.后端返回一个数组节点之间可以组成树-给定一个叶子节点的name，返回根节点到叶子节点的路径</span></li><li class="file-item"><span class="file-name">📄 16.hardman</span><a href="https://juejin.cn/post/7406150677225898023" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 17.实现版本号排序</span></li><li class="file-item"><span class="file-name">📄 18.将一个对象变成响应式</span></li><li class="file-item"><span class="file-name">📄 19.小于n的最大数</span><a href="https://edu.51cto.com/video/27365.html" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div></li></ul></div><div class="category"><h2 class="category-title">📂 11.单调栈</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.每日温度</span><a href="https://leetcode.cn/problems/daily-temperatures/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.下一个更大的元素</span><a href="https://leetcode.cn/problems/next-greater-element-i/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.下一个更大的元素2</span><a href="https://leetcode.cn/problems/next-greater-element-ii/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.接雨水</span><a href="https://leetcode.cn/problems/trapping-rain-water/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.柱状图中最大的矩形</span><a href="https://leetcode.cn/problems/largest-rectangle-in-histogram/description/" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 12.二分搜索</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.搜索旋转数组</span><a href="https://leetcode.cn/problems/search-in-rotated-sorted-array/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.旋转数组的最小值</span><a href="https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.二分查找</span><a href="https://leetcode.cn/problems/binary-search/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 4.找到第一个大于target的元素</span><a href="https://leetcode.cn/problems/binary-search/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 5.排序数组中查找元素的第一个和最后一个位置</span><a href="https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/description/" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 6.0~n-1缺失的数字</span><a href="https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/description/" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div><div class="category"><h2 class="category-title">📂 13.双指针</h2><ul class="file-list"><li class="file-item"><span class="file-name">📄 1.移动零</span><a href="https://leetcode.cn/problems/move-zeroes/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 2.盛最多水的容器</span><a href="https://leetcode.cn/problems/container-with-most-water/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li><li class="file-item"><span class="file-name">📄 3.三数之和</span><a href="https://leetcode.cn/problems/3sum/description/?envType=study-plan-v2&envId=top-100-liked" target="_blank" class="file-link">🔗 题目链接</a></li></ul></div>
<div class="footer">
<p>Created with ❤️ by Jacksyk</p>
<p>Released under the MIT License</p>
</div>
</div>
</body>
</html>