Add problem 3175: Find The First Player to win K Games in a Row

Author: EFanZh

src/lib.rs

@@ -2121,6 +2121,7 @@ pub mod problem_3168_minimum_number_of_chairs_in_a_waiting_room;
 pub mod problem_3169_count_days_without_meetings;
 pub mod problem_3170_lexicographically_minimum_string_after_removing_stars;
 pub mod problem_3174_clear_digits;
+pub mod problem_3175_find_the_first_player_to_win_k_games_in_a_row;
 pub mod problem_3350_adjacent_increasing_subarrays_detection_ii;
 
 #[cfg(test)]

src/problem_3175_find_the_first_player_to_win_k_games_in_a_row/iterative.rs

@@ -0,0 +1,46 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl Solution {
+    pub fn find_winning_player(skills: Vec<i32>, k: i32) -> i32 {
+        let skills = skills.into_iter().map(i32::cast_unsigned).collect::<Vec<_>>();
+        let mut iter = skills.iter().copied();
+        let k = k.cast_unsigned();
+        let mut best_index = 0;
+        let mut best_skill = iter.next().unwrap();
+        let mut best_wins = 0;
+
+        for (index, skill) in (1..).zip(iter) {
+            if skill > best_skill {
+                best_index = index;
+                best_skill = skill;
+                best_wins = 1;
+            } else {
+                best_wins += 1;
+            }
+
+            if best_wins >= k {
+                break;
+            }
+        }
+
+        best_index
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn find_winning_player(skills: Vec<i32>, k: i32) -> i32 {
+        Self::find_winning_player(skills, k)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_3175_find_the_first_player_to_win_k_games_in_a_row/mod.rs

@@ -0,0 +1,22 @@
+pub mod iterative;
+
+pub trait Solution {
+    fn find_winning_player(skills: Vec<i32>, k: i32) -> i32;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            ((&[4, 2, 6, 3, 9] as &[_], 2), 2),
+            ((&[2, 5, 4], 3), 1),
+            ((&[11, 9, 12, 2, 20, 1, 8], 3), 4),
+        ];
+
+        for ((skills, k), expected) in test_cases {
+            assert_eq!(S::find_winning_player(skills.to_vec(), k), expected);
+        }
+    }
+}