1535. Find the Winner of an Array Game LeetCode Solution
In this guide, you will get 1535. Find the Winner of an Array Game LeetCode Solution with the best time and space complexity. The solution to Find the Winner of an Array Game problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of 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 (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.
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 = 2
Output: 5
Explanation: Let’s see the rounds of the game:
Round | arr | winner | win_count
1 | [2,1,3,5,4,6,7] | 2 | 1
2 | [2,3,5,4,6,7,1] | 3 | 1
3 | [3,5,4,6,7,1,2] | 5 | 1
4 | [5,4,6,7,1,2,3] | 5 | 2
So we can see that 4 rounds will be played and 5 is the winner because it wins 2 consecutive games.
1535. Find the Winner of an Array Game LeetCode Solution in C++
class Solution {
public:
int getWinner(vector<int>& arr, int k) {
int ans = arr[0];
int wins = 0;
for (int i = 1; i < arr.size() && wins < k; ++i)
if (arr[i] > ans) {
ans = arr[i];
wins = 1;
} else {
++wins;
}
return ans;
}
}; /* code provided by PROGIEZ */
1535. Find the Winner of an Array Game LeetCode Solution in Java
class Solution {
public int getWinner(int[] arr, int k) {
int ans = arr[0];
int wins = 0;
for (int i = 1; i < arr.length && wins < k; ++i)
if (arr[i] > ans) {
ans = arr[i];
wins = 1;
} else {
++wins;
}
return ans;
}
} // code provided by PROGIEZ
1535. Find the Winner of an Array Game LeetCode Solution in Python
class Solution:
def getWinner(self, arr: list[int], k: int) -> int:
ans = arr[0]
wins = 0
i = 1
while i < len(arr) and wins < k:
if arr[i] > ans:
ans = arr[i]
wins = 1
else:
wins += 1
i += 1
return ans # code by PROGIEZ
