From cd4b5018bd6f7fbe26e5748aff15a2afb91240b4 Mon Sep 17 00:00:00 2001 From: jackfiled Date: Mon, 21 Apr 2025 13:59:31 +0800 Subject: [PATCH] 20250421 finished. --- src/problem/mod.rs | 2 + .../p2145_count_the_hidden_sequences.rs | 45 +++++++++++++++++++ 2 files changed, 47 insertions(+) create mode 100644 src/problem/p2145_count_the_hidden_sequences.rs diff --git a/src/problem/mod.rs b/src/problem/mod.rs index 489a876..9f09686 100644 --- a/src/problem/mod.rs +++ b/src/problem/mod.rs @@ -611,3 +611,5 @@ mod p2364_count_number_of_bad_pairs; mod p2563_count_the_number_of_fair_pairs; mod p781_rabbits_in_forest; + +mod p2145_count_the_hidden_sequences; diff --git a/src/problem/p2145_count_the_hidden_sequences.rs b/src/problem/p2145_count_the_hidden_sequences.rs new file mode 100644 index 0000000..90aa035 --- /dev/null +++ b/src/problem/p2145_count_the_hidden_sequences.rs @@ -0,0 +1,45 @@ +/** + * [2145] Count the Hidden Sequences + */ +pub struct Solution {} + +// submission codes start here + +impl Solution { + pub fn number_of_arrays(differences: Vec, lower: i32, upper: i32) -> i32 { + let mut min_value = 0i64; + let mut max_value = 0i64; + let mut last_value = 0i64; + + for i in differences.into_iter() { + let value = last_value + i as i64; + min_value = min_value.min(value); + max_value = max_value.max(value); + last_value = value; + } + + let range = max_value - min_value; + + let result = (upper - lower + 1) as i64 - range; + if result > 0 { + result as i32 + } else { + 0 + } + } +} + +// submission codes end + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn test_2145() { + assert_eq!(60, Solution::number_of_arrays(vec![-40], -46, 53)); + assert_eq!(2, Solution::number_of_arrays(vec![1, -3, 4], 1, 6)); + assert_eq!(4, Solution::number_of_arrays(vec![3, -4, 5, 1, -2], -4, 5)); + assert_eq!(0, Solution::number_of_arrays(vec![4, -7, 2], 3, 6)); + } +}