mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 12:16:27 +08:00
f68bbb0d59
* Revised the book * Update the book with the second revised edition * Revise base on the manuscript of the first edition
37 lines
738 B
Dart
37 lines
738 B
Dart
/**
|
||
* 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");
|
||
}
|