yetao
/
hello-algo
mirror of https://github.com/krahets/hello-algo.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

fix some typos (#1540)

Browse Source
pull/1556/head
Flamingo 2 weeks ago committed by GitHub
parent b3b10f2300
commit 57cf6b1ea6
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
6 changed files with 24 additions and 24 deletions
Show Stats Download Patch File Download Diff File

8
codes/csharp/chapter_dynamic_programming/min_path_sum.cs
Unescape View File

@ -105,7 +105,7 @@ public class min_path_sum {
// 暴力搜索 // 暴力搜索
int res = MinPathSumDFS(grid, n - 1, m - 1); int res = MinPathSumDFS(grid, n - 1, m - 1);
Console.WriteLine("从左上角到右下角的做小路径和为 " + res); Console.WriteLine("从左上角到右下角的最小路径和为 " + res);
// 记忆化搜索 // 记忆化搜索
int[][] mem = new int[n][]; int[][] mem = new int[n][];
@ -114,14 +114,14 @@ public class min_path_sum {
Array.Fill(mem[i], -1); Array.Fill(mem[i], -1);
} }
res = MinPathSumDFSMem(grid, mem, n - 1, m - 1); res = MinPathSumDFSMem(grid, mem, n - 1, m - 1);
Console.WriteLine("从左上角到右下角的做小路径和为 " + res); Console.WriteLine("从左上角到右下角的最小路径和为 " + res);
// 动态规划 // 动态规划
res = MinPathSumDP(grid); res = MinPathSumDP(grid);
Console.WriteLine("从左上角到右下角的做小路径和为 " + res); Console.WriteLine("从左上角到右下角的最小路径和为 " + res);
// 空间优化后的动态规划 // 空间优化后的动态规划
res = MinPathSumDPComp(grid); res = MinPathSumDPComp(grid);
Console.WriteLine("从左上角到右下角的做小路径和为 " + res); Console.WriteLine("从左上角到右下角的最小路径和为 " + res);
} }
} }

8
codes/dart/chapter_dynamic_programming/min_path_sum.dart
Unescape View File

@ -103,18 +103,18 @@ void main() {
// 暴力搜索 // 暴力搜索
int res = minPathSumDFS(grid, n - 1, m - 1); int res = minPathSumDFS(grid, n - 1, m - 1);
print("从左上角到右下角的做小路径和为 $res"); print("从左上角到右下角的最小路径和为 $res");
// 记忆化搜索 // 记忆化搜索
List<List<int>> mem = List.generate(n, (i) => List.filled(m, -1)); List<List<int>> mem = List.generate(n, (i) => List.filled(m, -1));
res = minPathSumDFSMem(grid, mem, n - 1, m - 1); res = minPathSumDFSMem(grid, mem, n - 1, m - 1);
print("从左上角到右下角的做小路径和为 $res"); print("从左上角到右下角的最小路径和为 $res");
// 动态规划 // 动态规划
res = minPathSumDP(grid); res = minPathSumDP(grid);
print("从左上角到右下角的做小路径和为 $res"); print("从左上角到右下角的最小路径和为 $res");
// 空间优化后的动态规划 // 空间优化后的动态规划
res = minPathSumDPComp(grid); res = minPathSumDPComp(grid);
print("从左上角到右下角的做小路径和为 $res"); print("从左上角到右下角的最小路径和为 $res");
} }

8
codes/go/chapter_dynamic_programming/min_path_sum_test.go
Unescape View File

@ -20,7 +20,7 @@ func TestMinPathSum(t *testing.T) {
// 暴力搜索 // 暴力搜索
res := minPathSumDFS(grid, n-1, m-1) res := minPathSumDFS(grid, n-1, m-1)
fmt.Printf("从左上角到右下角的做小路径和为 %d\n", res) fmt.Printf("从左上角到右下角的最小路径和为 %d\n", res)
// 记忆化搜索 // 记忆化搜索
mem := make([][]int, n) mem := make([][]int, n)
@ -31,13 +31,13 @@ func TestMinPathSum(t *testing.T) {
} }
} }
res = minPathSumDFSMem(grid, mem, n-1, m-1) res = minPathSumDFSMem(grid, mem, n-1, m-1)
fmt.Printf("从左上角到右下角的做小路径和为 %d\n", res) fmt.Printf("从左上角到右下角的最小路径和为 %d\n", res)
// 动态规划 // 动态规划
res = minPathSumDP(grid) res = minPathSumDP(grid)
fmt.Printf("从左上角到右下角的做小路径和为 %d\n", res) fmt.Printf("从左上角到右下角的最小路径和为 %d\n", res)
// 空间优化后的动态规划 // 空间优化后的动态规划
res = minPathSumDPComp(grid) res = minPathSumDPComp(grid)
fmt.Printf("从左上角到右下角的做小路径和为 %d\n", res) fmt.Printf("从左上角到右下角的最小路径和为 %d\n", res)
} }

8
codes/python/chapter_dynamic_programming/min_path_sum.py
Unescape View File

@ -88,17 +88,17 @@ if __name__ == "__main__":
# 暴力搜索 # 暴力搜索
res = min_path_sum_dfs(grid, n - 1, m - 1) res = min_path_sum_dfs(grid, n - 1, m - 1)
print(f"从左上角到右下角的做小路径和为 {res}") print(f"从左上角到右下角的最小路径和为 {res}")
# 记忆化搜索 # 记忆化搜索
mem = [[-1] * m for _ in range(n)] mem = [[-1] * m for _ in range(n)]
res = min_path_sum_dfs_mem(grid, mem, n - 1, m - 1) res = min_path_sum_dfs_mem(grid, mem, n - 1, m - 1)
print(f"从左上角到右下角的做小路径和为 {res}") print(f"从左上角到右下角的最小路径和为 {res}")
# 动态规划 # 动态规划
res = min_path_sum_dp(grid) res = min_path_sum_dp(grid)
print(f"从左上角到右下角的做小路径和为 {res}") print(f"从左上角到右下角的最小路径和为 {res}")
# 空间优化后的动态规划 # 空间优化后的动态规划
res = min_path_sum_dp_comp(grid) res = min_path_sum_dp_comp(grid)
print(f"从左上角到右下角的做小路径和为 {res}") print(f"从左上角到右下角的最小路径和为 {res}")

8
codes/ruby/chapter_dynamic_programming/min_path_sum.rb
Unescape View File

@ -76,18 +76,18 @@ if __FILE__ == $0
# 暴力搜索 # 暴力搜索
res = min_path_sum_dfs(grid, n - 1, m - 1) res = min_path_sum_dfs(grid, n - 1, m - 1)
puts "从左上角到右下角的做小路径和为 #{res}" puts "从左上角到右下角的最小路径和为 #{res}"
# 记忆化搜索 # 记忆化搜索
mem = Array.new(n) { Array.new(m, - 1) } mem = Array.new(n) { Array.new(m, - 1) }
res = min_path_sum_dfs_mem(grid, mem, n - 1, m -1) res = min_path_sum_dfs_mem(grid, mem, n - 1, m -1)
puts "从左上角到右下角的做小路径和为 #{res}" puts "从左上角到右下角的最小路径和为 #{res}"
# 动态规划 # 动态规划
res = min_path_sum_dp(grid) res = min_path_sum_dp(grid)
puts "从左上角到右下角的做小路径和为 #{res}" puts "从左上角到右下角的最小路径和为 #{res}"
# 空间优化后的动态规划 # 空间优化后的动态规划
res = min_path_sum_dp_comp(grid) res = min_path_sum_dp_comp(grid)
puts "从左上角到右下角的做小路径和为 #{res}" puts "从左上角到右下角的最小路径和为 #{res}"
end end

8
codes/swift/chapter_dynamic_programming/min_path_sum.swift
Unescape View File

@ -105,19 +105,19 @@ enum MinPathSum {
// 暴力搜索 // 暴力搜索
var res = minPathSumDFS(grid: grid, i: n - 1, j: m - 1) var res = minPathSumDFS(grid: grid, i: n - 1, j: m - 1)
print("从左上角到右下角的做小路径和为 \(res)") print("从左上角到右下角的最小路径和为 \(res)")
// 记忆化搜索 // 记忆化搜索
var mem = Array(repeating: Array(repeating: -1, count: m), count: n) var mem = Array(repeating: Array(repeating: -1, count: m), count: n)
res = minPathSumDFSMem(grid: grid, mem: &mem, i: n - 1, j: m - 1) res = minPathSumDFSMem(grid: grid, mem: &mem, i: n - 1, j: m - 1)
print("从左上角到右下角的做小路径和为 \(res)") print("从左上角到右下角的最小路径和为 \(res)")
// 动态规划 // 动态规划
res = minPathSumDP(grid: grid) res = minPathSumDP(grid: grid)
print("从左上角到右下角的做小路径和为 \(res)") print("从左上角到右下角的最小路径和为 \(res)")
// 空间优化后的动态规划 // 空间优化后的动态规划
res = minPathSumDPComp(grid: grid) res = minPathSumDPComp(grid: grid)
print("从左上角到右下角的做小路径和为 \(res)") print("从左上角到右下角的最小路径和为 \(res)")
} }
} }

Write Preview
Loading…
Cancel
Save