java链表实现约瑟夫

Java链表实现约瑟夫问题的代码如下：

import java.util.LinkedList;

public class Josephus {
    public static void main(String[] args) {
        int n = 7; // 总人数
        int m = 3; // 报数为3的出列
        LinkedList<Integer> list = new LinkedList<>();
        for (int i = 1; i <= n; i++) {
            list.add(i);
        }
        int index = 0;
        while (list.size() > 1) {
            index = (index + m - 1) % list.size();
            System.out.println("出列：" + list.remove(index));
        }
        System.out.println("最后留下：" + list.get(0));
    }
}