Add problem 3386: Button with Longest Push Time

Author: EFanZh

src/lib.rs

@@ -2211,6 +2211,7 @@ pub mod problem_3375_minimum_operations_to_make_array_values_equal_to_k;
 pub mod problem_3376_minimum_time_to_break_locks_i;
 pub mod problem_3379_transformed_array;
 pub mod problem_3381_maximum_subarray_sum_with_length_divisible_by_k;
+pub mod problem_3386_button_with_longest_push_time;
 
 #[cfg(test)]
 mod test_utilities;

src/problem_3386_button_with_longest_push_time/iterative.rs

@@ -0,0 +1,56 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+use std::cmp::Ordering;
+
+impl Solution {
+    pub fn button_with_longest_time(events: Vec<Vec<i32>>) -> i32 {
+        let mut max_index = 0;
+        let mut max_duration = 0;
+        let mut prev_index = 0;
+        let mut prev_time = 0;
+
+        events
+            .iter()
+            .filter_map(|event| <[i32; 2]>::try_from(event.as_slice()).ok())
+            .map(|event| event.map(i32::cast_unsigned))
+            .for_each(|[index, time]| {
+                let duration = time - prev_time;
+
+                match duration.cmp(&max_duration) {
+                    Ordering::Less => {}
+                    Ordering::Equal => {
+                        if index < max_index {
+                            max_index = index;
+                        }
+                    }
+                    Ordering::Greater => {
+                        max_duration = duration;
+                        max_index = index;
+                    }
+                }
+
+                prev_index = index;
+                prev_time = time;
+            });
+
+        max_index.cast_signed()
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn button_with_longest_time(events: Vec<Vec<i32>>) -> i32 {
+        Self::button_with_longest_time(events)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3386_button_with_longest_push_time/mod.rs

@@ -0,0 +1,24 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn button_with_longest_time(events: Vec<Vec<i32>>) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (&[[1, 2], [2, 5], [3, 9], [1, 15]] as &[_], 1),
+            (&[[10, 5], [1, 7]], 10),
+        ];
+
+        for (events, expected) in test_cases {
+            assert_eq!(
+                S::button_with_longest_time(events.iter().map(Vec::from).collect()),
+                expected,
+            );
+        }
+    }
+}