这是第一题最简单的递归解法，约瑟夫环变种 public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); k = 1; int res = circle(n, k) + 1; System.out.println(res); } private static int circle(int n, int m) { if(n == 0) return -1; if(n == 1) return 0; int res = (circle(n-1, m+1) + m + 1) % n; return res; }