Skip to content

Commit 57cf6b1

Browse files
Transmigration-zhouTransmigration-zhou
authored
fix some typos (#1540)
1 parent b3b10f2 commit 57cf6b1

File tree

6 files changed

+24
-24
lines changed

6 files changed

+24
-24
lines changed

‎codes/csharp/chapter_dynamic_programming/min_path_sum.cs‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -105,7 +105,7 @@ public void Test() {
105105

106106
// 暴力搜索
107107
int res = MinPathSumDFS(grid, n - 1, m - 1);
108-
Console.WriteLine("从左上角到右下角的做小路径和为 " + res);
108+
Console.WriteLine("从左上角到右下角的最小路径和为 " + res);
109109

110110
// 记忆化搜索
111111
int[][] mem = new int[n][];
@@ -114,14 +114,14 @@ public void Test() {
114114
Array.Fill(mem[i], -1);
115115
}
116116
res = MinPathSumDFSMem(grid, mem, n - 1, m - 1);
117-
Console.WriteLine("从左上角到右下角的做小路径和为 " + res);
117+
Console.WriteLine("从左上角到右下角的最小路径和为 " + res);
118118

119119
// 动态规划
120120
res = MinPathSumDP(grid);
121-
Console.WriteLine("从左上角到右下角的做小路径和为 " + res);
121+
Console.WriteLine("从左上角到右下角的最小路径和为 " + res);
122122

123123
// 空间优化后的动态规划
124124
res = MinPathSumDPComp(grid);
125-
Console.WriteLine("从左上角到右下角的做小路径和为 " + res);
125+
Console.WriteLine("从左上角到右下角的最小路径和为 " + res);
126126
}
127127
}

‎codes/dart/chapter_dynamic_programming/min_path_sum.dart‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -103,18 +103,18 @@ void main() {
103103

104104
// 暴力搜索
105105
int res = minPathSumDFS(grid, n - 1, m - 1);
106-
print("从左上角到右下角的做小路径和为 $res");
106+
print("从左上角到右下角的最小路径和为 $res");
107107

108108
// 记忆化搜索
109109
List<List<int>> mem = List.generate(n, (i) => List.filled(m, -1));
110110
res = minPathSumDFSMem(grid, mem, n - 1, m - 1);
111-
print("从左上角到右下角的做小路径和为 $res");
111+
print("从左上角到右下角的最小路径和为 $res");
112112

113113
// 动态规划
114114
res = minPathSumDP(grid);
115-
print("从左上角到右下角的做小路径和为 $res");
115+
print("从左上角到右下角的最小路径和为 $res");
116116

117117
// 空间优化后的动态规划
118118
res = minPathSumDPComp(grid);
119-
print("从左上角到右下角的做小路径和为 $res");
119+
print("从左上角到右下角的最小路径和为 $res");
120120
}

‎codes/go/chapter_dynamic_programming/min_path_sum_test.go‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -20,7 +20,7 @@ func TestMinPathSum(t *testing.T) {
2020

2121
// 暴力搜索
2222
res := minPathSumDFS(grid, n-1, m-1)
23-
fmt.Printf("从左上角到右下角的做小路径和为 %d\n", res)
23+
fmt.Printf("从左上角到右下角的最小路径和为 %d\n", res)
2424

2525
// 记忆化搜索
2626
mem := make([][]int, n)
@@ -31,13 +31,13 @@ func TestMinPathSum(t *testing.T) {
3131
}
3232
}
3333
res = minPathSumDFSMem(grid, mem, n-1, m-1)
34-
fmt.Printf("从左上角到右下角的做小路径和为 %d\n", res)
34+
fmt.Printf("从左上角到右下角的最小路径和为 %d\n", res)
3535

3636
// 动态规划
3737
res = minPathSumDP(grid)
38-
fmt.Printf("从左上角到右下角的做小路径和为 %d\n", res)
38+
fmt.Printf("从左上角到右下角的最小路径和为 %d\n", res)
3939

4040
// 空间优化后的动态规划
4141
res = minPathSumDPComp(grid)
42-
fmt.Printf("从左上角到右下角的做小路径和为 %d\n", res)
42+
fmt.Printf("从左上角到右下角的最小路径和为 %d\n", res)
4343
}

‎codes/python/chapter_dynamic_programming/min_path_sum.py‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -88,17 +88,17 @@ def min_path_sum_dp_comp(grid: list[list[int]]) -> int:
8888

8989
# 暴力搜索
9090
res = min_path_sum_dfs(grid, n - 1, m - 1)
91-
print(f"从左上角到右下角的做小路径和为 {res}")
91+
print(f"从左上角到右下角的最小路径和为 {res}")
9292

9393
# 记忆化搜索
9494
mem = [[-1] * m for _ in range(n)]
9595
res = min_path_sum_dfs_mem(grid, mem, n - 1, m - 1)
96-
print(f"从左上角到右下角的做小路径和为 {res}")
96+
print(f"从左上角到右下角的最小路径和为 {res}")
9797

9898
# 动态规划
9999
res = min_path_sum_dp(grid)
100-
print(f"从左上角到右下角的做小路径和为 {res}")
100+
print(f"从左上角到右下角的最小路径和为 {res}")
101101

102102
# 空间优化后的动态规划
103103
res = min_path_sum_dp_comp(grid)
104-
print(f"从左上角到右下角的做小路径和为 {res}")
104+
print(f"从左上角到右下角的最小路径和为 {res}")

‎codes/ruby/chapter_dynamic_programming/min_path_sum.rb‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -76,18 +76,18 @@ def min_path_sum_dp_comp(grid)
7676

7777
# 暴力搜索
7878
res = min_path_sum_dfs(grid, n - 1, m - 1)
79-
puts "从左上角到右下角的做小路径和为 #{res}"
79+
puts "从左上角到右下角的最小路径和为 #{res}"
8080

8181
# 记忆化搜索
8282
mem = Array.new(n) { Array.new(m, - 1) }
8383
res = min_path_sum_dfs_mem(grid, mem, n - 1, m -1)
84-
puts "从左上角到右下角的做小路径和为 #{res}"
84+
puts "从左上角到右下角的最小路径和为 #{res}"
8585

8686
# 动态规划
8787
res = min_path_sum_dp(grid)
88-
puts "从左上角到右下角的做小路径和为 #{res}"
88+
puts "从左上角到右下角的最小路径和为 #{res}"
8989

9090
# 空间优化后的动态规划
9191
res = min_path_sum_dp_comp(grid)
92-
puts "从左上角到右下角的做小路径和为 #{res}"
92+
puts "从左上角到右下角的最小路径和为 #{res}"
9393
end

‎codes/swift/chapter_dynamic_programming/min_path_sum.swift‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -105,19 +105,19 @@ enum MinPathSum {
105105

106106
// 暴力搜索
107107
var res = minPathSumDFS(grid: grid, i: n - 1, j: m - 1)
108-
print("从左上角到右下角的做小路径和为 \(res)")
108+
print("从左上角到右下角的最小路径和为 \(res)")
109109

110110
// 记忆化搜索
111111
var mem = Array(repeating: Array(repeating: -1, count: m), count: n)
112112
res = minPathSumDFSMem(grid: grid, mem: &mem, i: n - 1, j: m - 1)
113-
print("从左上角到右下角的做小路径和为 \(res)")
113+
print("从左上角到右下角的最小路径和为 \(res)")
114114

115115
// 动态规划
116116
res = minPathSumDP(grid: grid)
117-
print("从左上角到右下角的做小路径和为 \(res)")
117+
print("从左上角到右下角的最小路径和为 \(res)")
118118

119119
// 空间优化后的动态规划
120120
res = minPathSumDPComp(grid: grid)
121-
print("从左上角到右下角的做小路径和为 \(res)")
121+
print("从左上角到右下角的最小路径和为 \(res)")
122122
}
123123
}

0 commit comments

Comments
 (0)