feat: Add Dart codes for chapter_dynamic_programming and chapter_greedy (#683)

* feat: Add Dart codes for chapter_dynamic_programming * feat: Add Dart codes for chapter_greedy
2026-09-02 13:17:14 +00:00 · 2023-08-13 19:29:54 +08:00
parent 4325974af1
commit 10c397b172
16 changed files with 949 additions and 0 deletions
@@ -0,0 +1,37 @@
+/**
+ * File: max_capacity.dart
+ * Created Time: 2023-08-11
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+import 'dart:math';
+
+/* 最大容量：贪心 */
+int maxCapacity(List<int> ht) {
+  // 初始化 i, j 分列数组两端
+  int i = 0, j = ht.length - 1;
+  // 初始最大容量为 0
+  int res = 0;
+  // 循环贪心选择，直至两板相遇
+  while (i < j) {
+    // 更新最大容量
+    int cap = min(ht[i], ht[j]) * (j - i);
+    res = max(res, cap);
+    // 向内移动短板
+    if (ht[i] < ht[j]) {
+      i++;
+    } else {
+      j--;
+    }
+  }
+  return res;
+}
+
+/* Driver Code */
+void main() {
+  List<int> ht = [3, 8, 5, 2, 7, 7, 3, 4];
+
+  // 贪心算法
+  int res = maxCapacity(ht);
+  print("最大容量为 $res");
+}