Find the Winner of an Array Game
Given an integer array arr of distinct integers and an integer k.
A game will be played between the first two elements of the array, arr[0] and arr[1]. In each round of the game:
- Compare
arr[0]witharr[1]. - The larger integer wins and remains at position
0. - The smaller integer moves to the end of the array.
The game ends when an integer wins k consecutive rounds.
Return the integer which will win the game.
It is guaranteed that there will be a winner of the game.
Example 1
Input
arr = [2,1,3,5,4,6,7], k = 2Output
5After four rounds, 5 has won 2 consecutive games, so 5 is the winner.
Example 2
Input
arr = [3,2,1], k = 10Output
33 will win the first 10 rounds consecutively.
Constraints
- 2 <= arr.length <= 10^5
- 1 <= arr[i] <= 10^6
- arr contains distinct integers.
- 1 <= k <= 10^9