feat: add more

Author: gengjiawen

pools_todo/_1629_slowest_key.rs renamed to Array/_1629_slowest_key.rs

@@ -1,17 +1,17 @@
 // https://leetcode.com/problems/slowest-key
-// 
+//
 // A newly designed keypad was tested, where a tester pressed a sequence of `n` keys, one at a time.
-// 
+//
 // You are given a string `keysPressed` of length `n`, where `keysPressed[i]` was the `i<sup>th</sup>` key pressed in the testing sequence, and a sorted list `releaseTimes`, where `releaseTimes[i]` was the time the `i<sup>th</sup>` key was released. Both arrays are **0-indexed**. The `0<sup>th</sup>` key was pressed at the time `0`, and every subsequent key was pressed at the **exact** time the previous key was released.
-// 
+//
 // The tester wants to know the key of the keypress that had the **longest duration**. The `i<sup>th</sup>`keypress had a **duration** of `releaseTimes[i] - releaseTimes[i - 1]`, and the `0<sup>th</sup>` keypress had a duration of `releaseTimes[0]`.
-// 
+//
 // Note that the same key could have been pressed multiple times during the test, and these multiple presses of the same key **may not** have had the same **duration**.
-// 
+//
 // _Return the key of the keypress that had the **longest duration**. If there are multiple such keypresses, return the lexicographically largest key of the keypresses._
-// 
+//
 // **Example 1:**
-// 
+//
 // ```
 // **Input:** releaseTimes = [9,29,49,50], keysPressed = "cbcd"
 // **Output:** "c"
@@ -23,9 +23,9 @@
 // The longest of these was the keypress for 'b' and the second keypress for 'c', both with duration 20.
 // 'c' is lexicographically larger than 'b', so the answer is 'c'.
 // ```
-// 
+//
 // **Example 2:**
-// 
+//
 // ```
 // **Input:** releaseTimes = [12,23,36,46,62], keysPressed = "spuda"
 // **Output:** "a"
@@ -36,9 +36,9 @@
 // Keypress for 'd' had a duration of 46 - 36 = 10.
 // Keypress for 'a' had a duration of 62 - 46 = 16.
 // The longest of these was the keypress for 'a' with duration 16.```
-// 
+//
 // **Constraints:**
-// 
+//
 // *   `releaseTimes.length == n`
 // *   `keysPressed.length == n`
 // *   `2 <= n <= 1000`
@@ -47,9 +47,24 @@
 // *   `keysPressed` contains only lowercase English letters.
 
 pub fn slowest_key(release_times: Vec<i32>, keys_pressed: String) -> char {
-
+    let mut max_time = release_times[0];
+    let chars = keys_pressed.chars().collect::<Vec<char>>();
+    let mut max_char = chars[0];
+    for i in 1..chars.len() {
+        let diff = (release_times[i] - release_times[i - 1]);
+        if diff > max_time || (diff == max_time && chars[i] > max_char) {
+            max_time = diff;
+            max_char = chars[i];
+        }
     }
+    return max_char;
+}
 
 #[test]
 pub fn t1() {
+    assert_eq!(slowest_key(vec![9, 29, 49, 50], "cbcd".to_string()), 'c');
+    assert_eq!(
+        slowest_key(vec![12, 23, 36, 46, 62], "spuda".to_string()),
+        'a'
+    );
 }

Array/lib.rs

@@ -106,6 +106,7 @@ mod _1572_matrix_diagonal_sum;
 mod _1582_special_positions_in_a_binary_matrix;
 mod _1588_sum_of_all_odd_length_subarrays;
 mod _1619_mean_of_array_after_removing_some_elements;
+mod _1629_slowest_key;
 mod _1636_sort_array_by_increasing_frequency;
 mod _1640_check_array_formation_through_concatenation;
 mod _1652_defuse_the_bomb;