今天的每日一题 又见证了灵神的 顶级抽象

class Solution:
    def findWinningPlayer(self, skills: List[int], k: int) -> int:
        
        max_i = win = 0#初始化max_i ,win
        for i in range(1,len(skills)):
            if skills[i] > skills[max_i]:
                max_i = i
                win = 0#输了就归0
            win += 1#赢的那个会加一
            if win == k:
                break

        return max_i#最大那个肯定会一直赢