leetcode_solutions/
n2136_earliest_possible_day_of_full_bloom.rs

1/*
2 * No: 2136
3 * Title: Earliest Possible Day of Full Bloom
4 */
5
6use crate::Solution;
7
8impl Solution {
9    pub fn earliest_full_bloom(plant_time: Vec<i32>, grow_time: Vec<i32>) -> i32 {
10        let mut res = 0;
11        let mut flowers: Vec<(i32, i32)> =
12            grow_time.into_iter().zip(plant_time.into_iter()).collect();
13        flowers.sort_by_key(|k| k.0);
14
15        for (grow, plant) in flowers {
16            res = std::cmp::max(res, grow) + plant;
17        }
18
19        res
20    }
21}