build

2026-05-04 01:23:29 +08:00 · 2024-04-09 20:43:40 +08:00
parent d8caf02e9e
commit a6adc8e20a
48 changed files with 1599 additions and 571 deletions
--- a/docs/chapter_greedy/max_capacity_problem.md
+++ b/docs/chapter_greedy/max_capacity_problem.md
@@ -381,8 +381,8 @@ $$
        // 循环贪心选择，直至两板相遇
        while (i < j) {
            // 更新最大容量
-            val cap = (min(ht[i].toDouble(), ht[j].toDouble()) * (j - i)).toInt()
-            res = max(res.toDouble(), cap.toDouble()).toInt()
+            val cap = min(ht[i], ht[j]) * (j - i)
+            res = max(res, cap)
            // 向内移动短板
            if (ht[i] < ht[j]) {
                i++