From e2d6dc236840869b5b72bd0885e38501f38cd5bb Mon Sep 17 00:00:00 2001
From: krahets <krahets@163.com>
Date: Mon, 6 May 2024 03:56:37 +0800
Subject: [PATCH] Bug fixes

---
 codes/c/chapter_hashing/simple_hash.c                         | 2 +-
 codes/cpp/chapter_hashing/simple_hash.cpp                     | 2 +-
 codes/javascript/chapter_dynamic_programming/coin_change.js   | 4 ++--
 .../javascript/chapter_dynamic_programming/coin_change_ii.js  | 4 ++--
 codes/javascript/chapter_dynamic_programming/edit_distance.js | 4 ++--
 codes/javascript/chapter_dynamic_programming/knapsack.js      | 4 ++--
 .../min_cost_climbing_stairs_dp.js                            | 2 +-
 codes/javascript/chapter_dynamic_programming/min_path_sum.js  | 4 ++--
 .../chapter_dynamic_programming/unbounded_knapsack.js         | 4 ++--
 codes/typescript/chapter_dynamic_programming/coin_change.ts   | 4 ++--
 .../typescript/chapter_dynamic_programming/coin_change_ii.ts  | 4 ++--
 codes/typescript/chapter_dynamic_programming/edit_distance.ts | 4 ++--
 codes/typescript/chapter_dynamic_programming/knapsack.ts      | 4 ++--
 .../min_cost_climbing_stairs_dp.ts                            | 2 +-
 codes/typescript/chapter_dynamic_programming/min_path_sum.ts  | 4 ++--
 .../chapter_dynamic_programming/unbounded_knapsack.ts         | 4 ++--
 16 files changed, 28 insertions(+), 28 deletions(-)

diff --git a/codes/c/chapter_hashing/simple_hash.c b/codes/c/chapter_hashing/simple_hash.c
index f23ae49f7..a4ee0737f 100644
--- a/codes/c/chapter_hashing/simple_hash.c
+++ b/codes/c/chapter_hashing/simple_hash.c
@@ -50,7 +50,7 @@ int rotHash(char *key) {
 
 /* Driver Code */
 int main() {
-    char *key = "Hello dsad3241241dsa算123法";
+    char *key = "Hello 算法";
 
     int hash = addHash(key);
     printf("加法哈希值为 %d\n", hash);
diff --git a/codes/cpp/chapter_hashing/simple_hash.cpp b/codes/cpp/chapter_hashing/simple_hash.cpp
index 02b3eb7b7..9e0f8a07f 100644
--- a/codes/cpp/chapter_hashing/simple_hash.cpp
+++ b/codes/cpp/chapter_hashing/simple_hash.cpp
@@ -48,7 +48,7 @@ int rotHash(string key) {
 
 /* Driver Code */
 int main() {
-    string key = "Hello dsad3241241dsa算123法";
+    string key = "Hello 算法";
 
     int hash = addHash(key);
     cout << "加法哈希值为 " << hash << endl;
diff --git a/codes/javascript/chapter_dynamic_programming/coin_change.js b/codes/javascript/chapter_dynamic_programming/coin_change.js
index 287d946ed..7aa21b043 100644
--- a/codes/javascript/chapter_dynamic_programming/coin_change.js
+++ b/codes/javascript/chapter_dynamic_programming/coin_change.js
@@ -31,7 +31,7 @@ function coinChangeDP(coins, amt) {
     return dp[n][amt] !== MAX ? dp[n][amt] : -1;
 }
 
-/* 零钱兑换：状态压缩后的动态规划 */
+/* 零钱兑换：空间优化后的动态规划 */
 function coinChangeDPComp(coins, amt) {
     const n = coins.length;
     const MAX = amt + 1;
@@ -61,6 +61,6 @@ const amt = 4;
 let res = coinChangeDP(coins, amt);
 console.log(`凑到目标金额所需的最少硬币数量为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = coinChangeDPComp(coins, amt);
 console.log(`凑到目标金额所需的最少硬币数量为 ${res}`);
diff --git a/codes/javascript/chapter_dynamic_programming/coin_change_ii.js b/codes/javascript/chapter_dynamic_programming/coin_change_ii.js
index 6732b978f..5a1753365 100644
--- a/codes/javascript/chapter_dynamic_programming/coin_change_ii.js
+++ b/codes/javascript/chapter_dynamic_programming/coin_change_ii.js
@@ -30,7 +30,7 @@ function coinChangeIIDP(coins, amt) {
     return dp[n][amt];
 }
 
-/* 零钱兑换 II：状态压缩后的动态规划 */
+/* 零钱兑换 II：空间优化后的动态规划 */
 function coinChangeIIDPComp(coins, amt) {
     const n = coins.length;
     // 初始化 dp 表
@@ -59,6 +59,6 @@ const amt = 5;
 let res = coinChangeIIDP(coins, amt);
 console.log(`凑出目标金额的硬币组合数量为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = coinChangeIIDPComp(coins, amt);
 console.log(`凑出目标金额的硬币组合数量为 ${res}`);
diff --git a/codes/javascript/chapter_dynamic_programming/edit_distance.js b/codes/javascript/chapter_dynamic_programming/edit_distance.js
index 2553900b5..5c1258584 100644
--- a/codes/javascript/chapter_dynamic_programming/edit_distance.js
+++ b/codes/javascript/chapter_dynamic_programming/edit_distance.js
@@ -82,7 +82,7 @@ function editDistanceDP(s, t) {
     return dp[n][m];
 }
 
-/* 编辑距离：状态压缩后的动态规划 */
+/* 编辑距离：空间优化后的动态规划 */
 function editDistanceDPComp(s, t) {
     const n = s.length,
         m = t.length;
@@ -130,6 +130,6 @@ console.log(`将 ${s} 更改为 ${t} 最少需要编辑 ${res} 步`);
 res = editDistanceDP(s, t);
 console.log(`将 ${s} 更改为 ${t} 最少需要编辑 ${res} 步`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = editDistanceDPComp(s, t);
 console.log(`将 ${s} 更改为 ${t} 最少需要编辑 ${res} 步`);
diff --git a/codes/javascript/chapter_dynamic_programming/knapsack.js b/codes/javascript/chapter_dynamic_programming/knapsack.js
index 0f1058864..382e8dd7c 100644
--- a/codes/javascript/chapter_dynamic_programming/knapsack.js
+++ b/codes/javascript/chapter_dynamic_programming/knapsack.js
@@ -69,7 +69,7 @@ function knapsackDP(wgt, val, cap) {
     return dp[n][cap];
 }
 
-/* 0-1 背包：状态压缩后的动态规划 */
+/* 0-1 背包：空间优化后的动态规划 */
 function knapsackDPComp(wgt, val, cap) {
     const n = wgt.length;
     // 初始化 dp 表
@@ -108,6 +108,6 @@ console.log(`不超过背包容量的最大物品价值为 ${res}`);
 res = knapsackDP(wgt, val, cap);
 console.log(`不超过背包容量的最大物品价值为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = knapsackDPComp(wgt, val, cap);
 console.log(`不超过背包容量的最大物品价值为 ${res}`);
diff --git a/codes/javascript/chapter_dynamic_programming/min_cost_climbing_stairs_dp.js b/codes/javascript/chapter_dynamic_programming/min_cost_climbing_stairs_dp.js
index 0fc269704..58e2a349a 100644
--- a/codes/javascript/chapter_dynamic_programming/min_cost_climbing_stairs_dp.js
+++ b/codes/javascript/chapter_dynamic_programming/min_cost_climbing_stairs_dp.js
@@ -22,7 +22,7 @@ function minCostClimbingStairsDP(cost) {
     return dp[n];
 }
 
-/* 爬楼梯最小代价：状态压缩后的动态规划 */
+/* 爬楼梯最小代价：空间优化后的动态规划 */
 function minCostClimbingStairsDPComp(cost) {
     const n = cost.length - 1;
     if (n === 1 || n === 2) {
diff --git a/codes/javascript/chapter_dynamic_programming/min_path_sum.js b/codes/javascript/chapter_dynamic_programming/min_path_sum.js
index 4df7ec4a4..08c508f32 100644
--- a/codes/javascript/chapter_dynamic_programming/min_path_sum.js
+++ b/codes/javascript/chapter_dynamic_programming/min_path_sum.js
@@ -69,7 +69,7 @@ function minPathSumDP(grid) {
     return dp[n - 1][m - 1];
 }
 
-/* 最小路径和：状态压缩后的动态规划 */
+/* 最小路径和：空间优化后的动态规划 */
 function minPathSumDPComp(grid) {
     const n = grid.length,
         m = grid[0].length;
@@ -116,6 +116,6 @@ console.log(`从左上角到右下角的最小路径和为 ${res}`);
 res = minPathSumDP(grid);
 console.log(`从左上角到右下角的最小路径和为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = minPathSumDPComp(grid);
 console.log(`从左上角到右下角的最小路径和为 ${res}`);
diff --git a/codes/javascript/chapter_dynamic_programming/unbounded_knapsack.js b/codes/javascript/chapter_dynamic_programming/unbounded_knapsack.js
index 582ee4604..d6d6bfe66 100644
--- a/codes/javascript/chapter_dynamic_programming/unbounded_knapsack.js
+++ b/codes/javascript/chapter_dynamic_programming/unbounded_knapsack.js
@@ -29,7 +29,7 @@ function unboundedKnapsackDP(wgt, val, cap) {
     return dp[n][cap];
 }
 
-/* 完全背包：状态压缩后的动态规划 */
+/* 完全背包：空间优化后的动态规划 */
 function unboundedKnapsackDPComp(wgt, val, cap) {
     const n = wgt.length;
     // 初始化 dp 表
@@ -58,6 +58,6 @@ const cap = 4;
 let res = unboundedKnapsackDP(wgt, val, cap);
 console.log(`不超过背包容量的最大物品价值为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = unboundedKnapsackDPComp(wgt, val, cap);
 console.log(`不超过背包容量的最大物品价值为 ${res}`);
diff --git a/codes/typescript/chapter_dynamic_programming/coin_change.ts b/codes/typescript/chapter_dynamic_programming/coin_change.ts
index 68de13845..27d90aeba 100644
--- a/codes/typescript/chapter_dynamic_programming/coin_change.ts
+++ b/codes/typescript/chapter_dynamic_programming/coin_change.ts
@@ -31,7 +31,7 @@ function coinChangeDP(coins: Array<number>, amt: number): number {
     return dp[n][amt] !== MAX ? dp[n][amt] : -1;
 }
 
-/* 零钱兑换：状态压缩后的动态规划 */
+/* 零钱兑换：空间优化后的动态规划 */
 function coinChangeDPComp(coins: Array<number>, amt: number): number {
     const n = coins.length;
     const MAX = amt + 1;
@@ -61,7 +61,7 @@ const amt = 4;
 let res = coinChangeDP(coins, amt);
 console.log(`凑到目标金额所需的最少硬币数量为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = coinChangeDPComp(coins, amt);
 console.log(`凑到目标金额所需的最少硬币数量为 ${res}`);
 
diff --git a/codes/typescript/chapter_dynamic_programming/coin_change_ii.ts b/codes/typescript/chapter_dynamic_programming/coin_change_ii.ts
index 431e40901..7dd02e994 100644
--- a/codes/typescript/chapter_dynamic_programming/coin_change_ii.ts
+++ b/codes/typescript/chapter_dynamic_programming/coin_change_ii.ts
@@ -30,7 +30,7 @@ function coinChangeIIDP(coins: Array<number>, amt: number): number {
     return dp[n][amt];
 }
 
-/* 零钱兑换 II：状态压缩后的动态规划 */
+/* 零钱兑换 II：空间优化后的动态规划 */
 function coinChangeIIDPComp(coins: Array<number>, amt: number): number {
     const n = coins.length;
     // 初始化 dp 表
@@ -59,7 +59,7 @@ const amt = 5;
 let res = coinChangeIIDP(coins, amt);
 console.log(`凑出目标金额的硬币组合数量为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = coinChangeIIDPComp(coins, amt);
 console.log(`凑出目标金额的硬币组合数量为 ${res}`);
 
diff --git a/codes/typescript/chapter_dynamic_programming/edit_distance.ts b/codes/typescript/chapter_dynamic_programming/edit_distance.ts
index 8cd4be86a..4d163a1d3 100644
--- a/codes/typescript/chapter_dynamic_programming/edit_distance.ts
+++ b/codes/typescript/chapter_dynamic_programming/edit_distance.ts
@@ -90,7 +90,7 @@ function editDistanceDP(s: string, t: string): number {
     return dp[n][m];
 }
 
-/* 编辑距离：状态压缩后的动态规划 */
+/* 编辑距离：空间优化后的动态规划 */
 function editDistanceDPComp(s: string, t: string): number {
     const n = s.length,
         m = t.length;
@@ -141,7 +141,7 @@ console.log(`将 ${s} 更改为 ${t} 最少需要编辑 ${res} 步`);
 res = editDistanceDP(s, t);
 console.log(`将 ${s} 更改为 ${t} 最少需要编辑 ${res} 步`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = editDistanceDPComp(s, t);
 console.log(`将 ${s} 更改为 ${t} 最少需要编辑 ${res} 步`);
 
diff --git a/codes/typescript/chapter_dynamic_programming/knapsack.ts b/codes/typescript/chapter_dynamic_programming/knapsack.ts
index da2f588c5..a840b1548 100644
--- a/codes/typescript/chapter_dynamic_programming/knapsack.ts
+++ b/codes/typescript/chapter_dynamic_programming/knapsack.ts
@@ -84,7 +84,7 @@ function knapsackDP(
     return dp[n][cap];
 }
 
-/* 0-1 背包：状态压缩后的动态规划 */
+/* 0-1 背包：空间优化后的动态规划 */
 function knapsackDPComp(
     wgt: Array<number>,
     val: Array<number>,
@@ -127,7 +127,7 @@ console.log(`不超过背包容量的最大物品价值为 ${res}`);
 res = knapsackDP(wgt, val, cap);
 console.log(`不超过背包容量的最大物品价值为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = knapsackDPComp(wgt, val, cap);
 console.log(`不超过背包容量的最大物品价值为 ${res}`);
 
diff --git a/codes/typescript/chapter_dynamic_programming/min_cost_climbing_stairs_dp.ts b/codes/typescript/chapter_dynamic_programming/min_cost_climbing_stairs_dp.ts
index ade829b58..48710b1ce 100644
--- a/codes/typescript/chapter_dynamic_programming/min_cost_climbing_stairs_dp.ts
+++ b/codes/typescript/chapter_dynamic_programming/min_cost_climbing_stairs_dp.ts
@@ -22,7 +22,7 @@ function minCostClimbingStairsDP(cost: Array<number>): number {
     return dp[n];
 }
 
-/* 爬楼梯最小代价：状态压缩后的动态规划 */
+/* 爬楼梯最小代价：空间优化后的动态规划 */
 function minCostClimbingStairsDPComp(cost: Array<number>): number {
     const n = cost.length - 1;
     if (n === 1 || n === 2) {
diff --git a/codes/typescript/chapter_dynamic_programming/min_path_sum.ts b/codes/typescript/chapter_dynamic_programming/min_path_sum.ts
index 60e7aa81f..f0c149ccb 100644
--- a/codes/typescript/chapter_dynamic_programming/min_path_sum.ts
+++ b/codes/typescript/chapter_dynamic_programming/min_path_sum.ts
@@ -78,7 +78,7 @@ function minPathSumDP(grid: Array<Array<number>>): number {
     return dp[n - 1][m - 1];
 }
 
-/* 最小路径和：状态压缩后的动态规划 */
+/* 最小路径和：空间优化后的动态规划 */
 function minPathSumDPComp(grid: Array<Array<number>>): number {
     const n = grid.length,
         m = grid[0].length;
@@ -125,7 +125,7 @@ console.log(`从左上角到右下角的最小路径和为 ${res}`);
 res = minPathSumDP(grid);
 console.log(`从左上角到右下角的最小路径和为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = minPathSumDPComp(grid);
 console.log(`从左上角到右下角的最小路径和为 ${res}`);
 
diff --git a/codes/typescript/chapter_dynamic_programming/unbounded_knapsack.ts b/codes/typescript/chapter_dynamic_programming/unbounded_knapsack.ts
index 9005b99b8..8abc5a6d6 100644
--- a/codes/typescript/chapter_dynamic_programming/unbounded_knapsack.ts
+++ b/codes/typescript/chapter_dynamic_programming/unbounded_knapsack.ts
@@ -33,7 +33,7 @@ function unboundedKnapsackDP(
     return dp[n][cap];
 }
 
-/* 完全背包：状态压缩后的动态规划 */
+/* 完全背包：空间优化后的动态规划 */
 function unboundedKnapsackDPComp(
     wgt: Array<number>,
     val: Array<number>,
@@ -66,7 +66,7 @@ const cap = 4;
 let res = unboundedKnapsackDP(wgt, val, cap);
 console.log(`不超过背包容量的最大物品价值为 ${res}`);
 
-// 状态压缩后的动态规划
+// 空间优化后的动态规划
 res = unboundedKnapsackDPComp(wgt, val, cap);
 console.log(`不超过背包容量的最大物品价值为 ${res}`);