1class Solution:2 def findTheWinner(self, n, k):3 ls = list(range(1, n + 1))4 while len(ls) > 1:5 i = (k - 1) % len(ls)6 ls.pop(i)7 ls = ls[i:] + ls[:i]89 return ls[0]
WPM •0 •0
ACC •0 •0
TIME •0