mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-27 18:26:28 +08:00
f68bbb0d59
* Revised the book * Update the book with the second revised edition * Revise base on the manuscript of the first edition
36 lines
831 B
Rust
36 lines
831 B
Rust
/*
|
||
* File: coin_change_greedy.rs
|
||
* Created Time: 2023-07-22
|
||
* Author: night-cruise (2586447362@qq.com)
|
||
*/
|
||
|
||
/* 最大容量：贪心 */
|
||
fn max_capacity(ht: &[i32]) -> i32 {
|
||
// 初始化 i, j，使其分列数组两端
|
||
let mut i = 0;
|
||
let mut j = ht.len() - 1;
|
||
// 初始最大容量为 0
|
||
let mut res = 0;
|
||
// 循环贪心选择，直至两板相遇
|
||
while i < j {
|
||
// 更新最大容量
|
||
let cap = std::cmp::min(ht[i], ht[j]) * (j - i) as i32;
|
||
res = std::cmp::max(res, cap);
|
||
// 向内移动短板
|
||
if ht[i] < ht[j] {
|
||
i += 1;
|
||
} else {
|
||
j -= 1;
|
||
}
|
||
}
|
||
res
|
||
}
|
||
|
||
/* Driver Code */
|
||
fn main() {
|
||
let ht = [3, 8, 5, 2, 7, 7, 3, 4];
|
||
|
||
// 贪心算法
|
||
let res = max_capacity(&ht);
|
||
println!("最大容量为 {}", res);
|
||
}
|