Add problem 3282: Reach End of Array With Max Score

Author: EFanZh

src/lib.rs

@@ -2168,6 +2168,7 @@ pub mod problem_3274_check_if_two_chessboard_squares_have_the_same_color;
 pub mod problem_3275_k_th_nearest_obstacle_queries;
 pub mod problem_3280_convert_date_to_binary;
 pub mod problem_3281_maximize_score_of_numbers_in_ranges;
+pub mod problem_3282_reach_end_of_array_with_max_score;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3282_reach_end_of_array_with_max_score/greedy.rs

@@ -0,0 +1,37 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn find_maximum_score(nums: Vec<i32>) -> i64 {
+        let mut nums = nums;
+        let mut prev = 0;
+
+        nums.pop();
+
+        nums.into_iter()
+            .map(|num| {
+                prev = prev.max(u64::from(num.cast_unsigned()));
+
+                prev
+            })
+            .sum::<u64>()
+            .cast_signed()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn find_maximum_score(nums: Vec<i32>) -> i64 {
+        Self::find_maximum_score(nums)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3282_reach_end_of_array_with_max_score/mod.rs

@@ -0,0 +1,18 @@
+pub mod greedy;
+
+pub trait Solution {
+    fn find_maximum_score(nums: Vec<i32>) -> i64;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [(&[1, 3, 1, 5] as &[_], 7), (&[4, 3, 1, 3, 2], 16)];
+
+        for (nums, expected) in test_cases {
+            assert_eq!(S::find_maximum_score(nums.to_vec()), expected);
+        }
+    }
+}