m1823 v2 Daily O(n) Recursive Josephus Problem.py

class Solution:
    def findTheWinner(self, n: int, k: int) -> int:
        return 1 if n == 1 else (1 + (self.findTheWinner(n - 1, k) + k - 1) % n)