约瑟夫环问题 Java 实现 - 找出剩余的 p 个人

import java.util.ArrayList;import java.util.List;import java.util.Scanner;public class JosephusProblem {public static void main(String[] args) {Scanner scanner = new Scanner(System.in);System.out.print("请输入n：");int n = scanner.nextInt();System.out.print("请输入m：");int m = scanner.nextInt();System.out.print("请输入p：");int p = scanner.nextInt();List people = new ArrayList<>();for (int i = 1; i <= n; i++) {people.add(i);}int count = 0;int current = 0;while (people.size() > p) {count++;if (count == m) {people.remove(current);count = 0;} else {current++;}if (current == people.size()) {current = 0;}}for (int i = 0; i < people.size(); i++) {System.out.println(people.get(i));}}}