hhhh,今天连遇两道简单题,太爽了。
每日一题
class Solution:
def getWinner(self, arr: List[int], k: int) -> int:
n=len(arr)
flag=0
if n<=k:
return max(arr)
current_num = arr[0]
consecutive_wins = 0
for i in range(1, n):
if arr[i] > current_num:
#替换当前的计数
current_num = arr[i]
consecutive_wins = 1
else:
consecutive_wins += 1
if consecutive_wins == k:
return current_num
return current_num