题解 | 约瑟夫环
约瑟夫环
https://www.nowcoder.com/practice/e417cfe32c74416ca38247f619ddb322
n, k, m = map(int,input().split()) nums, idx = list(range(n)), k#注意下标变化 while len(nums)>1: idx = (idx+m-1)%len(nums)#注意下标变化 nums.pop(idx) print(nums[0])
约瑟夫环
https://www.nowcoder.com/practice/e417cfe32c74416ca38247f619ddb322
n, k, m = map(int,input().split()) nums, idx = list(range(n)), k#注意下标变化 while len(nums)>1: idx = (idx+m-1)%len(nums)#注意下标变化 nums.pop(idx) print(nums[0])
相关推荐