LeetCode/problems/rs/kids-with-the-greatest-number-of-candies.rs
Matej Focko 333866d1bc
chore: split solutions by language
Signed-off-by: Matej Focko <mfocko@redhat.com>
2023-06-02 17:19:02 +02:00

41 lines
894 B
Rust

struct Solution {}
impl Solution {
pub fn kids_with_candies(candies: Vec<i32>, extra_candies: i32) -> Vec<bool> {
let max = *candies.iter().max().unwrap();
candies
.iter()
.map(|candies| candies + extra_candies >= max)
.collect()
}
}
fn main() {}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn example_1() {
assert_eq!(
Solution::kids_with_candies(vec![2, 3, 5, 1, 3], 3),
vec![true, true, true, false, true]
);
}
#[test]
fn example_2() {
assert_eq!(
Solution::kids_with_candies(vec![4, 2, 1, 1, 2], 1),
vec![true, false, false, false, false]
);
}
#[test]
fn example_3() {
assert_eq!(
Solution::kids_with_candies(vec![12, 1, 12], 10),
vec![true, false, true]
);
}
}