find-the-winner-of-an-array-game

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>arr</code> of distinct integers and an integer <code>k</code>.

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.

Return the integer which will win the game.

It is guaranteed that there will be a winner of the game.

&nbsp;
Example 1:

<pre>
Input: arr = [2,1,3,5,4,6,7], k = 2
Output: 5
Explanation: Let&#39;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>

Example 2:

<pre>
Input: arr = [3,2,1], k = 10
Output: 3
Explanation: 3 will win the first 10 rounds consecutively.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= arr.length &lt;= 105</code></li>
	<li><code>1 &lt;= arr[i] &lt;= 106</code></li>
	<li><code>arr</code> contains distinct integers.</li>
	<li><code>1 &lt;= k &lt;= 109</code></li>
</ul>

getWinner

Find the Winner of an Array Game

Array

Simulation

给你一个由 不同 整数组成的整数数组 <code>arr</code> 和一个整数 <code>k</code> 。

每回合游戏都在数组的前两个元素（即 <code>arr[0]</code> 和 <code>arr[1]</code> ）之间进行。比较 <code>arr[0]</code> 与 <code>arr[1]</code> 的大小，较大的整数将会取得这一回合的胜利并保留在位置 <code>0</code> ，较小的整数移至数组的末尾。当一个整数赢得 <code>k</code> 个连续回合时，游戏结束，该整数就是比赛的 赢家 。

返回赢得比赛的整数。

题目数据 保证 游戏存在赢家。

&nbsp;

示例 1：

<pre>输入：arr = [2,1,3,5,4,6,7], k = 2
输出：5
解释：一起看一下本场游戏每回合的情况：
<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/07/30/q-example.png" style="height: 90px; width: 400px;">
因此将进行 4 回合比赛，其中 5 是赢家，因为它连胜 2 回合。
</pre>

示例 2：

<pre>输入：arr = [3,2,1], k = 10
输出：3
解释：3 将会在前 10 个回合中连续获胜。
</pre>

示例 3：

<pre>输入：arr = [1,9,8,2,3,7,6,4,5], k = 7
输出：9
</pre>

示例 4：

<pre>输入：arr = [1,11,22,33,44,55,66,77,88,99], k = 1000000000
输出：99
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= arr.length &lt;= 10^5</code></li>
	<li><code>1 &lt;= arr[i] &lt;= 10^6</code></li>
	<li><code>arr</code> 所含的整数 各不相同 。</li>
	<li><code>1 &lt;= k &lt;= 10^9</code></li>
</ul>