约瑟夫环问题 def choose(n,k): i=0 j=-1 alist=list(range(1,n+1)) while len(alist)>1: while j < len(alist)-1: i += 1 j += 1 if i % k == 0: i=0 alist[j]=0 j = -1 while 0 in alist: alist.remove(0) return alist print(choose(5,2))