Skip to content

[pull] master from labuladong:master #33

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:master from labuladong:master

Nov 26, 2022

Merged

[pull] master from labuladong:master #33

Changes from all commits

Commits

Show all changes

Select commit

labuladong Nov 26, 2022

File filter

Filter by extension

Conversations

Jump to

Jump to file

Failed to load files.

Loading

Diff view

Diff view

1 change: 1 addition & 0 deletions 动态规划系列/动态规划详解进阶.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -479,6 +479,7 @@ int coinChange(int[] coins, int amount) {
		\| [221. Maximal Square](https://leetcode.com/problems/maximal-square/?show=1) \| [221. 最大正方形](https://leetcode.cn/problems/maximal-square/?show=1) \|
		\| [240. Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/?show=1) \| [240. 搜索二维矩阵 II](https://leetcode.cn/problems/search-a-2d-matrix-ii/?show=1) \|
		\| [256. Paint House](https://leetcode.com/problems/paint-house/?show=1)🔒 \| [256. 粉刷房子](https://leetcode.cn/problems/paint-house/?show=1)🔒 \|
	\| [542. 01 Matrix](https://leetcode.com/problems/01-matrix/?show=1) \| [542. 01 矩阵](https://leetcode.cn/problems/01-matrix/?show=1) \|
		\| [62. Unique Paths](https://leetcode.com/problems/unique-paths/?show=1) \| [62. 不同路径](https://leetcode.cn/problems/unique-paths/?show=1) \|
		\| [63. Unique Paths II](https://leetcode.com/problems/unique-paths-ii/?show=1) \| [63. 不同路径 II](https://leetcode.cn/problems/unique-paths-ii/?show=1) \|
		\| [70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/?show=1) \| [70. 爬楼梯](https://leetcode.cn/problems/climbing-stairs/?show=1) \|
Expand Down

13 changes: 13 additions & 0 deletions 数据结构系列/dijkstra算法.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -861,6 +861,19 @@ double dijkstra(int start, int end, List<double[]>[] graph) {



	<hr>
	<details>
	<summary><strong>引用本文的题目</strong></summary>

	<strong>安装 [我的 Chrome 刷题插件](https://mp.weixin.qq.com/s/X-fE9sR4BLi6T9pn7xP4pg) 点开下列题目可直接查看解题思路:</strong>

	\| LeetCode \| 力扣 \|
	\| :----: \| :----: \|
	\| [542. 01 Matrix](https://leetcode.com/problems/01-matrix/?show=1) \| [542. 01 矩阵](https://leetcode.cn/problems/01-matrix/?show=1) \|

	</details>



		_____________

Expand Down

1 change: 1 addition & 0 deletions 数据结构系列/图.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -347,6 +347,7 @@ void traverse(int[][] graph, int s, LinkedList<Integer> path) {
		\| [133. Clone Graph](https://leetcode.com/problems/clone-graph/?show=1) \| [133. 克隆图](https://leetcode.cn/problems/clone-graph/?show=1) \|
		\| [200. Number of Islands](https://leetcode.com/problems/number-of-islands/?show=1) \| [200. 岛屿数量](https://leetcode.cn/problems/number-of-islands/?show=1) \|
		\| [2049. Count Nodes With the Highest Score](https://leetcode.com/problems/count-nodes-with-the-highest-score/?show=1) \| [2049. 统计最高分的节点数目](https://leetcode.cn/problems/count-nodes-with-the-highest-score/?show=1) \|
	\| [542. 01 Matrix](https://leetcode.com/problems/01-matrix/?show=1) \| [542. 01 矩阵](https://leetcode.cn/problems/01-matrix/?show=1) \|
		\| - \| [剑指 Offer II 110. 所有路径](https://leetcode.cn/problems/bP4bmD/?show=1) \|

		</details>
Expand Down

1 change: 1 addition & 0 deletions 算法思维系列/BFS框架.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -414,6 +414,7 @@ while (!q1.isEmpty() && !q2.isEmpty()) {
		\| [102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/?show=1) \| [102. 二叉树的层序遍历](https://leetcode.cn/problems/binary-tree-level-order-traversal/?show=1) \|
		\| [117. Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/?show=1) \| [117. 填充每个节点的下一个右侧节点指针 II](https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii/?show=1) \|
		\| [431. Encode N-ary Tree to Binary Tree](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree/?show=1)🔒 \| [431. 将 N 叉树编码为二叉树](https://leetcode.cn/problems/encode-n-ary-tree-to-binary-tree/?show=1)🔒 \|
	\| [542. 01 Matrix](https://leetcode.com/problems/01-matrix/?show=1) \| [542. 01 矩阵](https://leetcode.cn/problems/01-matrix/?show=1) \|
		\| [773. Sliding Puzzle](https://leetcode.com/problems/sliding-puzzle/?show=1) \| [773. 滑动谜题](https://leetcode.cn/problems/sliding-puzzle/?show=1) \|
		\| [863. All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/?show=1) \| [863. 二叉树中所有距离为 K 的结点](https://leetcode.cn/problems/all-nodes-distance-k-in-binary-tree/?show=1) \|
		\| - \| [剑指 Offer 32 - II. 从上到下打印二叉树 II](https://leetcode.cn/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/?show=1) \|
Expand Down

2 changes: 2 additions & 0 deletions 算法思维系列/花式遍历.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -319,6 +319,8 @@ int[][] generateMatrix(int n) {
		\| LeetCode \| 力扣 \|
		\| :----: \| :----: \|
		\| [1260. Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/?show=1) \| [1260. 二维网格迁移](https://leetcode.cn/problems/shift-2d-grid/?show=1) \|
	\| [1329. Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/?show=1) \| [1329. 将矩阵按对角线排序](https://leetcode.cn/problems/sort-the-matrix-diagonally/?show=1) \|
	\| [867. Transpose Matrix](https://leetcode.com/problems/transpose-matrix/?show=1) \| [867. 转置矩阵](https://leetcode.cn/problems/transpose-matrix/?show=1) \|

		</details>

Expand Down