mirror of
https://github.com/krahets/hello-algo.git
synced 2025-11-02 21:24:53 +08:00
44effb07e6
* Sync zh and zh-hant version. * Add the Warp sponsor banner. * Update README with acknowledgments and Warp recommendation Added acknowledgments and a recommendation for the Warp terminal application. * Update README.md * Update links in README.md to use HTTPS * Sync zh and zh-hant versions. * Add special thanks for Warp spnsorship. * Use official warp image link.
50 lines
1.0 KiB
C
50 lines
1.0 KiB
C
/**
|
||
* File: max_capacity.c
|
||
* Created Time: 2023-09-15
|
||
* Author: xianii (xianyi.xia@outlook.com)
|
||
*/
|
||
|
||
#include "../utils/common.h"
|
||
|
||
/* 求最小值 */
|
||
int myMin(int a, int b) {
|
||
return a < b ? a : b;
|
||
}
|
||
/* 求最大值 */
|
||
int myMax(int a, int b) {
|
||
return a > b ? a : b;
|
||
}
|
||
|
||
/* 最大容量：貪婪 */
|
||
int maxCapacity(int ht[], int htLength) {
|
||
// 初始化 i, j，使其分列陣列兩端
|
||
int i = 0;
|
||
int j = htLength - 1;
|
||
// 初始最大容量為 0
|
||
int res = 0;
|
||
// 迴圈貪婪選擇，直至兩板相遇
|
||
while (i < j) {
|
||
// 更新最大容量
|
||
int capacity = myMin(ht[i], ht[j]) * (j - i);
|
||
res = myMax(res, capacity);
|
||
// 向內移動短板
|
||
if (ht[i] < ht[j]) {
|
||
i++;
|
||
} else {
|
||
j--;
|
||
}
|
||
}
|
||
return res;
|
||
}
|
||
|
||
/* Driver Code */
|
||
int main(void) {
|
||
int ht[] = {3, 8, 5, 2, 7, 7, 3, 4};
|
||
|
||
// 貪婪演算法
|
||
int res = maxCapacity(ht, sizeof(ht) / sizeof(int));
|
||
printf("最大容量為 %d\n", res);
|
||
|
||
return 0;
|
||
}
|