mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
41 lines
1.6 KiB
HTML
41 lines
1.6 KiB
HTML
<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> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [2,1,3,5,4,6,7], k = 2
|
|
<strong>Output:</strong> 5
|
|
<strong>Explanation:</strong> 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.
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr = [3,2,1], k = 10
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong> 3 will win the first 10 rounds consecutively.
|
|
</pre>
|
|
|
|
<p> </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>
|