CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-04 03:00:06 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Revised the book (#978)

Browse Source 
* Sync recent changes to the revised Word.

* Revised the preface chapter

* Revised the introduction chapter

* Revised the computation complexity chapter

* Revised the chapter data structure

* Revised the chapter array and linked list

* Revised the chapter stack and queue

* Revised the chapter hashing

* Revised the chapter tree

* Revised the chapter heap

* Revised the chapter graph

* Revised the chapter searching

* Reivised the sorting chapter

* Revised the divide and conquer chapter

* Revised the chapter backtacking

* Revised the DP chapter

* Revised the greedy chapter

* Revised the appendix chapter

* Revised the preface chapter doubly

* Revised the figures
This commit is contained in:
Yudong Jin
2023-12-02 06:21:34 +08:00
committed by GitHub
parent b824d149cb
commit e720aa2d24
404 changed files with 1537 additions and 1558 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/go/chapter_dynamic_programming/climbing_stairs_backtrack.go
View File

@@ -24,7 +24,7 @@ func backtrack(choices []int, state, n int, res []int) {
/* 爬楼梯：回溯 */
func climbingStairsBacktrack(n int) int {
// 可选择向上爬 1 或 2 阶
// 可选择向上爬 1 阶或 2 阶
choices := []int{1, 2}
// 从第 0 阶开始爬
state := 0

2
codes/go/chapter_dynamic_programming/coin_change.go
View File

@@ -19,7 +19,7 @@ func coinChangeDP(coins []int, amt int) int {
for a := 1; a <= amt; a++ {
dp[0][a] = max
}
// 状态转移：其余行列
// 状态转移：其余行和列
for i := 1; i <= n; i++ {
for a := 1; a <= amt; a++ {
if coins[i-1] > a {

2
codes/go/chapter_dynamic_programming/coin_change_ii.go
View File

@@ -16,7 +16,7 @@ func coinChangeIIDP(coins []int, amt int) int {
for i := 0; i <= n; i++ {
dp[i][0] = 1
}
// 状态转移：其余行列
// 状态转移：其余行和列
for i := 1; i <= n; i++ {
for a := 1; a <= amt; a++ {
if coins[i-1] > a {

2
codes/go/chapter_dynamic_programming/edit_distance.go
View File

@@ -76,7 +76,7 @@ func editDistanceDP(s string, t string) int {
for j := 1; j <= m; j++ {
dp[0][j] = j
}
// 状态转移：其余行列
// 状态转移：其余行和列
for i := 1; i <= n; i++ {
for j := 1; j <= m; j++ {
if s[i-1] == t[j-1] {

8
codes/go/chapter_dynamic_programming/knapsack.go
View File

@@ -8,11 +8,11 @@ import "math"
/* 0-1 背包：暴力搜索 */
func knapsackDFS(wgt, val []int, i, c int) int {
// 若已选完所有物品或背包无容量，则返回价值 0
// 若已选完所有物品或背包无剩余容量，则返回价值 0
if i == 0 || c == 0 {
return 0
}
// 若超过背包容量，则只能不放入背包
// 若超过背包容量，则只能选择不放入背包
if wgt[i-1] > c {
return knapsackDFS(wgt, val, i-1, c)
}
@@ -25,7 +25,7 @@ func knapsackDFS(wgt, val []int, i, c int) int {
/* 0-1 背包：记忆化搜索 */
func knapsackDFSMem(wgt, val []int, mem [][]int, i, c int) int {
// 若已选完所有物品或背包无容量，则返回价值 0
// 若已选完所有物品或背包无剩余容量，则返回价值 0
if i == 0 || c == 0 {
return 0
}
@@ -33,7 +33,7 @@ func knapsackDFSMem(wgt, val []int, mem [][]int, i, c int) int {
if mem[i][c] != -1 {
return mem[i][c]
}
// 若超过背包容量，则只能不放入背包
// 若超过背包容量，则只能选择不放入背包
if wgt[i-1] > c {
return knapsackDFSMem(wgt, val, mem, i-1, c)
}

4
codes/go/chapter_dynamic_programming/min_path_sum.go
View File

@@ -62,7 +62,7 @@ func minPathSumDP(grid [][]int) int {
for i := 1; i < n; i++ {
dp[i][0] = dp[i-1][0] + grid[i][0]
}
// 状态转移：其余行列
// 状态转移：其余行和列
for i := 1; i < n; i++ {
for j := 1; j < m; j++ {
dp[i][j] = int(math.Min(float64(dp[i][j-1]), float64(dp[i-1][j]))) + grid[i][j]
@@ -81,7 +81,7 @@ func minPathSumDPComp(grid [][]int) int {
for j := 1; j < m; j++ {
dp[j] = dp[j-1] + grid[0][j]
}
// 状态转移：其余行列
// 状态转移：其余行和列
for i := 1; i < n; i++ {
// 状态转移：首列
dp[0] = dp[0] + grid[i][0]