Skip to content

[pull] main from itcharge:main #217

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged

pull merged 1 commit into AlgorithmAndLeetCode:main from itcharge:main

Sep 9, 2025

Merged

[pull] main from itcharge:main #217

Changes from all commits

Commits

Show all changes

Select commit

修复和优化语句表述

itcharge Sep 9, 2025

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

4 changes: 2 additions & 2 deletions docs/06_graph/06_01_graph_basic.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -53,8 +53,8 @@

		根据图中是否存在环,可以将图分为「环形图」和「无环图」:

	- 环形图(Circular Graph):如果图中至少存在一条环,则称为环形图。
	- 无环图(Acyclic Graph):如果图中不存在任何环,则称为无环图。
	- 环形图(Cyclic Graph):如果图中至少存在一条环(Cycle),则称该图为环形图或含环图。
	- 无环图(Acyclic Graph):如果图中不存在任何环,则称该图为无环图。

		对于有向图,如果不存在环,则称为「有向无环图(Directed Acyclic Graph, DAG)」。DAG 结构在动态规划、最短路径、数据压缩等算法中有着广泛应用。

Expand Down

2 changes: 1 addition & 1 deletion docs/07_algorithm/07_02_recursive_algorithm.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -4,7 +4,7 @@

		以阶乘为例,数学定义如下:

	$fact(n) = \begin{cases} 1 & \text{n = 0} \cr n \times fact(n - 1) & \text{n > 0} \end{cases}$
	$$fact(n) = \begin{cases} 1 & \text{n = 0} \cr n \times fact(n - 1) & \text{n > 0} \end{cases}$$

		我们可以直接用调用函数自身的方式实现阶乘函数 $fact(n),ドル代码如下:

Expand Down

Loading