Class Solution
java.lang.Object
g1501_1600.s1535_find_the_winner_of_an_array_game.Solution
1535 - Find the Winner of an Array Game.<p>Medium</p>
<p>Given an integer array <code>arr</code> of <strong>distinct</strong> integers and an integer <code>k</code>.</p>
<p>A game will be played between the first two elements of the array (i.e. <code>arr[0]</code> and <code>arr[1]</code>). In each round of the game, we compare <code>arr[0]</code> with <code>arr[1]</code>, the larger integer wins and remains at position <code>0</code>, and the smaller integer moves to the end of the array. The game ends when an integer wins <code>k</code> consecutive rounds.</p>
<p>Return <em>the integer which will win the game</em>.</p>
<p>It is <strong>guaranteed</strong> that there will be a winner of the game.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> arr = [2,1,3,5,4,6,7], k = 2</p>
<p><strong>Output:</strong> 5</p>
<p><strong>Explanation:</strong> Let’s see the rounds of the game:</p>
<pre><code> 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
</code></pre>
<p>So we can see that 4 rounds will be played and 5 is the winner because it wins 2 consecutive games.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> arr = [3,2,1], k = 10</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Explanation:</strong> 3 will win the first 10 rounds consecutively.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>2 <= arr.length <= 10<sup>5</sup></code></li>
<li><code>1 <= arr[i] <= 10<sup>6</sup></code></li>
<li><code>arr</code> contains <strong>distinct</strong> integers.</li>
<li><code>1 <= k <= 10<sup>9</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
getWinner
public int getWinner(int[] arr, int k)
-