build

docs/chapter_dynamic_programming/dp_problem_features.md

@@ -295,7 +295,7 @@ $$
         dp[2] = cost[2]
         // 状态转移：从较小子问题逐步求解较大子问题
         for (i in 3..n) {
-            dp[i] = (min(dp[i - 1].toDouble(), dp[i - 2].toDouble()) + cost[i]).toInt()
+            dp[i] = min(dp[i - 1], dp[i - 2]) + cost[i]
         }
         return dp[n]
     }
@@ -559,7 +559,7 @@ $$
         var b = cost[2]
         for (i in 3..n) {
             val tmp = b
-            b = (min(a.toDouble(), tmp.toDouble()) + cost[i]).toInt()
+            b = min(a, tmp) + cost[i]
             a = tmp
         }
         return b