mirror of
https://github.com/krahets/hello-algo.git
synced 2026-09-24 23:36:34 +08:00
feat: add rust codes for chapter greedy (#646)
* feat: add rust codes for chapter greedy * Update max_product_cutting.rs --------- Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
@@ -0,0 +1,36 @@
|
||||
/*
|
||||
* 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);
|
||||
}
|
||||
Reference in New Issue
Block a user