mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
69 lines
3.1 KiB
HTML
69 lines
3.1 KiB
HTML
<p>A competition consists of <code>n</code> players numbered from <code>0</code> to <code>n - 1</code>.</p>
|
|
|
|
<p>You are given an integer array <code>skills</code> of size <code>n</code> and a <strong>positive</strong> integer <code>k</code>, where <code>skills[i]</code> is the skill level of player <code>i</code>. All integers in <code>skills</code> are <strong>unique</strong>.</p>
|
|
|
|
<p>All players are standing in a queue in order from player <code>0</code> to player <code>n - 1</code>.</p>
|
|
|
|
<p>The competition process is as follows:</p>
|
|
|
|
<ul>
|
|
<li>The first two players in the queue play a game, and the player with the <strong>higher</strong> skill level wins.</li>
|
|
<li>After the game, the winner stays at the beginning of the queue, and the loser goes to the end of it.</li>
|
|
</ul>
|
|
|
|
<p>The winner of the competition is the <strong>first</strong> player who wins <code>k</code> games <strong>in a row</strong>.</p>
|
|
|
|
<p>Return the initial index of the <em>winning</em> player.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">skills = [4,2,6,3,9], k = 2</span></p>
|
|
|
|
<p><strong>Output:</strong> 2</p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<p>Initially, the queue of players is <code>[0,1,2,3,4]</code>. The following process happens:</p>
|
|
|
|
<ul>
|
|
<li>Players 0 and 1 play a game, since the skill of player 0 is higher than that of player 1, player 0 wins. The resulting queue is <code>[0,2,3,4,1]</code>.</li>
|
|
<li>Players 0 and 2 play a game, since the skill of player 2 is higher than that of player 0, player 2 wins. The resulting queue is <code>[2,3,4,1,0]</code>.</li>
|
|
<li>Players 2 and 3 play a game, since the skill of player 2 is higher than that of player 3, player 2 wins. The resulting queue is <code>[2,4,1,0,3]</code>.</li>
|
|
</ul>
|
|
|
|
<p>Player 2 won <code>k = 2</code> games in a row, so the winner is player 2.</p>
|
|
</div>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>Input:</strong> <span class="example-io">skills = [2,5,4], k = 3</span></p>
|
|
|
|
<p><strong>Output:</strong> 1</p>
|
|
|
|
<p><strong>Explanation:</strong></p>
|
|
|
|
<p>Initially, the queue of players is <code>[0,1,2]</code>. The following process happens:</p>
|
|
|
|
<ul>
|
|
<li>Players 0 and 1 play a game, since the skill of player 1 is higher than that of player 0, player 1 wins. The resulting queue is <code>[1,2,0]</code>.</li>
|
|
<li>Players 1 and 2 play a game, since the skill of player 1 is higher than that of player 2, player 1 wins. The resulting queue is <code>[1,0,2]</code>.</li>
|
|
<li>Players 1 and 0 play a game, since the skill of player 1 is higher than that of player 0, player 1 wins. The resulting queue is <code>[1,2,0]</code>.</li>
|
|
</ul>
|
|
|
|
<p>Player 1 won <code>k = 3</code> games in a row, so the winner is player 1.</p>
|
|
</div>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == skills.length</code></li>
|
|
<li><code>2 <= n <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= k <= 10<sup>9</sup></code></li>
|
|
<li><code>1 <= skills[i] <= 10<sup>6</sup></code></li>
|
|
<li>All integers in <code>skills</code> are unique.</li>
|
|
</ul>
|