Last updated 2 years ago
My Solution:
class Solution: def findTheWinner(self, n: int, k: int) -> int: if k == 1: return n lst = list(range(1, n+1)) p = n ptr = -1 while p != 1: x = ptr + k ptr = x if x < p else x % p lst.pop(ptr) ptr -= 1 p -= 1 return lst[0]