Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit da62711

Browse files
Merge pull request Snailclimb#2230 from Mister-Hope/main
chore: update deps and format docs
2 parents face018 + 2f4deb0 commit da62711

File tree

123 files changed

+968
-1034
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

123 files changed

+968
-1034
lines changed

‎.github/workflows/test.yml‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,17 +10,17 @@ jobs:
1010
runs-on: ubuntu-latest
1111
steps:
1212
- name: Checkout
13-
uses: actions/checkout@v3
13+
uses: actions/checkout@v4
1414

1515
- name: Install pnpm
1616
uses: pnpm/action-setup@v2
1717
with:
1818
run_install: true
1919

2020
- name: Setup Node.js
21-
uses: actions/setup-node@v3
21+
uses: actions/setup-node@v4
2222
with:
23-
node-version: 18
23+
node-version: 20
2424
cache: pnpm
2525

2626
- name: Build test

‎.markdownlint-cli2.mjs‎

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
export default {
2+
config: {
3+
default: true,
4+
MD003: {
5+
style: "atx",
6+
},
7+
MD004: {
8+
style: "dash",
9+
},
10+
MD010: false,
11+
MD013: false,
12+
MD024: {
13+
allow_different_nesting: true,
14+
},
15+
MD035: {
16+
style: "---",
17+
},
18+
MD036: false,
19+
MD040: false,
20+
MD045: false,
21+
MD046: false,
22+
},
23+
ignores: [
24+
"**/node_modules/**",
25+
// markdown import demo
26+
"**/*.snippet.md",
27+
],
28+
};

‎.markdownlint.json‎

Lines changed: 0 additions & 20 deletions
This file was deleted.

‎.markdownlintignore‎

Lines changed: 0 additions & 4 deletions
This file was deleted.

‎README.md‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -103,7 +103,7 @@
103103

104104
### JVM (必看 :+1:)
105105

106-
JVM 这部分内容主要参考 [JVM 虚拟机规范-Java8](https://docs.oracle.com/javase/specs/jvms/se8/html/index.html) 和周志明老师的[《深入理解 Java 虚拟机(第 3 版)》](https://book.douban.com/subject/34907497/) (强烈建议阅读多遍!)。
106+
JVM 这部分内容主要参考 [JVM 虚拟机规范-Java8](https://docs.oracle.com/javase/specs/jvms/se8/html/index.html) 和周志明老师的[《深入理解 Java 虚拟机(第 3 版)》](https://book.douban.com/subject/34907497/) (强烈建议阅读多遍!)。
107107

108108
- **[Java 内存区域](./docs/java/jvm/memory-area.md)**
109109
- **[JVM 垃圾回收](./docs/java/jvm/jvm-garbage-collection.md)**
@@ -183,8 +183,8 @@ JVM 这部分内容主要参考 [JVM 虚拟机规范-Java8 ](https://docs.oracle
183183

184184
**常见算法问题总结**:
185185

186-
- [几道常见的字符串算法题总结](./docs/cs-basics/algorithms/string-algorithm-problems.md)
187-
- [几道常见的链表算法题总结](./docs/cs-basics/algorithms/linkedlist-algorithm-problems.md)
186+
- [几道常见的字符串算法题总结](./docs/cs-basics/algorithms/string-algorithm-problems.md)
187+
- [几道常见的链表算法题总结](./docs/cs-basics/algorithms/linkedlist-algorithm-problems.md)
188188
- [剑指 offer 部分编程题](./docs/cs-basics/algorithms/the-sword-refers-to-offer.md)
189189
- [十大经典排序算法](./docs/cs-basics/algorithms/10-classical-sorting-algorithms.md)
190190

‎docs/.vuepress/config.ts‎

Lines changed: 0 additions & 33 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,4 @@
11
import { defineUserConfig } from "vuepress";
2-
import { searchPlugin } from "@vuepress/plugin-search";
32
import theme from "./theme.js";
43

54
export default defineUserConfig({
@@ -48,38 +47,6 @@ export default defineUserConfig({
4847

4948
theme,
5049

51-
plugins: [
52-
searchPlugin({
53-
// https://v2.vuepress.vuejs.org/zh/reference/plugin/search.html
54-
// 排除首页
55-
isSearchable: (page) => page.path !== "/",
56-
maxSuggestions: 10,
57-
hotKeys: ["s", "/"],
58-
// 用于在页面的搜索索引中添加额外字段
59-
getExtraFields: () => [],
60-
locales: {
61-
"/": {
62-
placeholder: "搜索",
63-
},
64-
},
65-
}),
66-
// searchProPlugin({
67-
// indexContent: true,
68-
// indexOptions: {
69-
// tokenize: (text, fieldName) =>
70-
// fieldName === "id" ? [text] : cut(text, true),
71-
// },
72-
// customFields: [
73-
// {
74-
// getter: ({ frontmatter }) =>
75-
// <string | undefined>frontmatter.category ?? null,
76-
// formatter: "分类: $content",
77-
// },
78-
// ],
79-
// suggestDelay: 60,
80-
// }),
81-
],
82-
8350
pagePatterns: ["**/*.md", "!**/*.snippet.md", "!.vuepress", "!node_modules"],
8451

8552
shouldPrefetch: false,

‎docs/.vuepress/theme.ts‎

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -87,5 +87,10 @@ export default hopeTheme({
8787
},
8888
tasklist: true,
8989
},
90+
91+
search: {
92+
isSearchable: (page) => page.path !== "/",
93+
maxSuggestions: 10,
94+
},
9095
},
9196
});

‎docs/cs-basics/algorithms/classical-algorithm-problems-recommendations.md‎

Lines changed: 20 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -20,15 +20,15 @@ tag:
2020

2121
### LeetCode
2222

23-
455.分发饼干:https://leetcode.cn/problems/assign-cookies/
23+
455.分发饼干:<https://leetcode.cn/problems/assign-cookies/>
2424

25-
121.买卖股票的最佳时机:https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/
25+
121.买卖股票的最佳时机:<https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/>
2626

27-
122.买卖股票的最佳时机 II:https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/
27+
122.买卖股票的最佳时机 II:<https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/>
2828

29-
55.跳跃游戏:https://leetcode.cn/problems/jump-game/
29+
55.跳跃游戏:<https://leetcode.cn/problems/jump-game/>
3030

31-
45.跳跃游戏 II:https://leetcode.cn/problems/jump-game-ii/
31+
45.跳跃游戏 II:<https://leetcode.cn/problems/jump-game-ii/>
3232

3333
## 动态规划
3434

@@ -48,17 +48,17 @@ tag:
4848

4949
### LeetCode
5050

51-
509.斐波那契数:https://leetcode.cn/problems/fibonacci-number/
51+
509.斐波那契数:<https://leetcode.cn/problems/fibonacci-number/>
5252

53-
746.使用最小花费爬楼梯:https://leetcode.cn/problems/min-cost-climbing-stairs/
53+
746.使用最小花费爬楼梯:<https://leetcode.cn/problems/min-cost-climbing-stairs/>
5454

55-
416.分割等和子集:https://leetcode.cn/problems/partition-equal-subset-sum/
55+
416.分割等和子集:<https://leetcode.cn/problems/partition-equal-subset-sum/>
5656

57-
518.零钱兑换:https://leetcode.cn/problems/coin-change-ii/
57+
518.零钱兑换:<https://leetcode.cn/problems/coin-change-ii/>
5858

59-
647.回文子串:https://leetcode.cn/problems/palindromic-substrings/
59+
647.回文子串:<https://leetcode.cn/problems/palindromic-substrings/>
6060

61-
516.最长回文子序列:https://leetcode.cn/problems/longest-palindromic-subsequence/
61+
516.最长回文子序列:<https://leetcode.cn/problems/longest-palindromic-subsequence/>
6262

6363
## 回溯算法
6464

@@ -78,17 +78,17 @@ tag:
7878

7979
### leetcode
8080

81-
77.组合:https://leetcode.cn/problems/combinations/
81+
77.组合:<https://leetcode.cn/problems/combinations/>
8282

83-
39.组合总和:https://leetcode.cn/problems/combination-sum/
83+
39.组合总和:<https://leetcode.cn/problems/combination-sum/>
8484

85-
40.组合总和 II:https://leetcode.cn/problems/combination-sum-ii/
85+
40.组合总和 II:<https://leetcode.cn/problems/combination-sum-ii/>
8686

87-
78.子集:https://leetcode.cn/problems/subsets/
87+
78.子集:<https://leetcode.cn/problems/subsets/>
8888

89-
90.子集 II:https://leetcode.cn/problems/subsets-ii/
89+
90.子集 II:<https://leetcode.cn/problems/subsets-ii/>
9090

91-
51.N 皇后:https://leetcode.cn/problems/n-queens/
91+
51.N 皇后:<https://leetcode.cn/problems/n-queens/>
9292

9393
## 分治算法
9494

@@ -106,9 +106,8 @@ tag:
106106

107107
### LeetCode
108108

109-
108.将有序数组转换成二叉搜索数:https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/
109+
108.将有序数组转换成二叉搜索数:<https://leetcode.cn/problems/convert-sorted-array-to-binary-search-tree/>
110110

111-
148.排序列表:https://leetcode.cn/problems/sort-list/
112-
113-
23.合并 k 个升序链表:https://leetcode.cn/problems/merge-k-sorted-lists/
111+
148.排序列表:<https://leetcode.cn/problems/sort-list/>
114112

113+
23.合并 k 个升序链表:<https://leetcode.cn/problems/merge-k-sorted-lists/>

‎docs/cs-basics/algorithms/common-data-structures-leetcode-recommendations.md‎

Lines changed: 23 additions & 26 deletions
Original file line numberDiff line numberDiff line change
@@ -7,61 +7,58 @@ tag:
77

88
## 数组
99

10-
704.二分查找:https://leetcode.cn/problems/binary-search/
10+
704.二分查找:<https://leetcode.cn/problems/binary-search/>
1111

12-
80.删除有序数组中的重复项 II:https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii
12+
80.删除有序数组中的重复项 II:<https://leetcode.cn/problems/remove-duplicates-from-sorted-array-ii>
1313

14-
977.有序数组的平方:https://leetcode.cn/problems/squares-of-a-sorted-array/
14+
977.有序数组的平方:<https://leetcode.cn/problems/squares-of-a-sorted-array/>
1515

1616
## 链表
1717

18-
707.设计链表:https://leetcode.cn/problems/design-linked-list/
18+
707.设计链表:<https://leetcode.cn/problems/design-linked-list/>
1919

20-
206.反转链表:https://leetcode.cn/problems/reverse-linked-list/
20+
206.反转链表:<https://leetcode.cn/problems/reverse-linked-list/>
2121

22-
92.反转链表 II:https://leetcode.cn/problems/reverse-linked-list-ii/
22+
92.反转链表 II:<https://leetcode.cn/problems/reverse-linked-list-ii/>
2323

24-
61.旋转链表:https://leetcode.cn/problems/rotate-list/
24+
61.旋转链表:<https://leetcode.cn/problems/rotate-list/>
2525

2626
## 栈与队列
2727

28-
232.用栈实现队列:https://leetcode.cn/problems/implement-queue-using-stacks/
28+
232.用栈实现队列:<https://leetcode.cn/problems/implement-queue-using-stacks/>
2929

30-
225.用队列实现栈:https://leetcode.cn/problems/implement-stack-using-queues/
30+
225.用队列实现栈:<https://leetcode.cn/problems/implement-stack-using-queues/>
3131

32-
347.前 K 个高频元素:https://leetcode.cn/problems/top-k-frequent-elements/
32+
347.前 K 个高频元素:<https://leetcode.cn/problems/top-k-frequent-elements/>
3333

34-
239.滑动窗口最大值:https://leetcode.cn/problems/sliding-window-maximum/
34+
239.滑动窗口最大值:<https://leetcode.cn/problems/sliding-window-maximum/>
3535

3636
## 二叉树
3737

38-
105.从前序与中序遍历构造二叉树:https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
38+
105.从前序与中序遍历构造二叉树:<https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/>
3939

40-
117.填充每个节点的下一个右侧节点指针 II:https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii
40+
117.填充每个节点的下一个右侧节点指针 II:<https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii>
4141

42-
236.二叉树的最近公共祖先:https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/
42+
236.二叉树的最近公共祖先:<https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-tree/>
4343

44-
129.求根节点到叶节点数字之和:https://leetcode.cn/problems/sum-root-to-leaf-numbers/
44+
129.求根节点到叶节点数字之和:<https://leetcode.cn/problems/sum-root-to-leaf-numbers/>
4545

46-
102.二叉树的层序遍历:https://leetcode.cn/problems/binary-tree-level-order-traversal/
46+
102.二叉树的层序遍历:<https://leetcode.cn/problems/binary-tree-level-order-traversal/>
4747

48-
530.二叉搜索树的最小绝对差:https://leetcode.cn/problems/minimum-absolute-difference-in-bst/
48+
530.二叉搜索树的最小绝对差:<https://leetcode.cn/problems/minimum-absolute-difference-in-bst/>
4949

5050
## 图
5151

52-
200.岛屿数量:https://leetcode.cn/problems/number-of-islands/
52+
200.岛屿数量:<https://leetcode.cn/problems/number-of-islands/>
5353

54-
207.课程表:https://leetcode.cn/problems/course-schedule/
54+
207.课程表:<https://leetcode.cn/problems/course-schedule/>
5555

56-
210.课程表 II:https://leetcode.cn/problems/course-schedule-ii/
56+
210.课程表 II:<https://leetcode.cn/problems/course-schedule-ii/>
5757

5858
## 堆
5959

60-
215. 数组中的第 K 个最大元素:https://leetcode.cn/problems/kth-largest-element-in-an-array/
61-
62-
215. 数据流的中位数:https://leetcode.cn/problems/find-median-from-data-stream/
63-
64-
215. 前 K 个高频元素:https://leetcode.cn/problems/top-k-frequent-elements/
65-
60+
215.数组中的第 K 个最大元素:<https://leetcode.cn/problems/kth-largest-element-in-an-array/>
6661

62+
216.数据流的中位数:<https://leetcode.cn/problems/find-median-from-data-stream/>
6763

64+
217.前 K 个高频元素:<https://leetcode.cn/problems/top-k-frequent-elements/>

‎docs/cs-basics/algorithms/linkedlist-algorithm-problems.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@ tag:
2525

2626
Leetcode 官方详细解答地址:
2727

28-
https://leetcode-cn.com/problems/add-two-numbers/solution/
28+
<https://leetcode-cn.com/problems/add-two-numbers/solution/>
2929

3030
> 要对头结点进行操作时,考虑创建哑节点 dummy,使用 dummy->next 表示真正的头节点。这样可以避免处理头节点为空的边界问题。
3131

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /