1535. Find the Winner of an Array Game Medium

1/**
2 * [1535] Find the Winner of an Array Game
3 *
4 * Given an integer array arr of distinct integers and an integer k.
5 * A game will be played between the first two elements of the array (i.e. arr[0] and arr[1]). In each round of the game, we compare arr[0] with arr[1], the larger integer wins and remains at position 0, and the smaller integer moves to the end of the array. The game ends when an integer wins k consecutive rounds.
6 * Return the integer which will win the game.
7 * It is guaranteed that there will be a winner of the game.
8 *  
9 * Example 1:
10 * 
11 * Input: arr = [2,1,3,5,4,6,7], k = 2
12 * Output: 5
13 * Explanation: Let's see the rounds of the game:
14 * Round |       arr       | winner | win_count
15 *   1   | [2,1,3,5,4,6,7] | 2      | 1
16 *   2   | [2,3,5,4,6,7,1] | 3      | 1
17 *   3   | [3,5,4,6,7,1,2] | 5      | 1
18 *   4   | [5,4,6,7,1,2,3] | 5      | 2
19 * So we can see that 4 rounds will be played and 5 is the winner because it wins 2 consecutive games.
20 * 
21 * Example 2:
22 * 
23 * Input: arr = [3,2,1], k = 10
24 * Output: 3
25 * Explanation: 3 will win the first 10 rounds consecutively.
26 * 
27 *  
28 * Constraints:
29 * 
30 * 	2 <= arr.length <= 10^5
31 * 	1 <= arr[i] <= 10^6
32 * 	arr contains distinct integers.
33 * 	1 <= k <= 10^9
34 * 
35 */
36pub struct Solution {}
37
38// problem: https://leetcode.com/problems/find-the-winner-of-an-array-game/
39// discuss: https://leetcode.com/problems/find-the-winner-of-an-array-game/discuss/?currentPage=1&orderBy=most_votes&query=
40
41// submission codes start here
42
43impl Solution {
44    pub fn get_winner(arr: Vec<i32>, k: i32) -> i32 {
45        0
46    }
47}
48
49// submission codes end
50
51#[cfg(test)]
52mod tests {
53    use super::*;
54
55    #[test]
56    fn test_1535() {
57    }
58}
59