题目要求
约瑟夫环问题了解一下
约瑟夫环问题其实在数据结构里与单循环链表关系密切,但是这里模拟就完事~~
AC代码(Java语言描述)
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int num = scanner.nextInt();
scanner.close();
boolean flag = false;
int temp = num;
while (!flag) {
temp++;
int next = 0;
for (int i = 0; i < num; i++) {
next = (next+temp-1) % (2*num-i);
if (next < num) {
break;
}
if (i == num-1) {
flag = true;
}
}
}
System.out.println(temp);
}
}