【数据结构与算法】Josephu问题

/**
 约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，
 第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，
 被杀掉的顺序是：5，4，6，2，3。
 **/
public class Josephu {
    public static void main(String[] args) {
        CircleSingleLinkedList csll = new CircleSingleLinkedList();
        csll.addBoy(25);
        csll.showBoy();
        csll.calculateBoy(1,2,25);
    }
}

//创建环形的单链表
class CircleSingleLinkedList{
    //创建一个first节点
    private Boy first = null;

    //添加节点构成环形链表
    public void addBoy(int nums){
        if(nums < 1){
            System.out.println("nums值不正确");
            return;
        }
        Boy currBoy = null;//辅助指针，帮助构建环形链表
        for (int i = 1; i <= nums; i++) {
            Boy boy = new Boy(i);
            if(i == 1){
                first = boy;
                first.setNext(first);
                currBoy = first;
            }else{
                currBoy.setNext(boy);
                boy.setNext(first);
                currBoy = boy;
            }
        }
    }

    //遍历环形链表
    public void showBoy(){
        if (first == null){
            System.out.println("链表为空");
            return;
        }
        //first不能动
        Boy currBoy = first;
        while(true){
            System.out.println("no:"+currBoy.getNo());
            if(currBoy.getNext() == first){
                break;
            }
            currBoy = currBoy.getNext();
        }
    }

    //根据用户的输入，计算出圈顺序

    public void calculateBoy(int startNo,int countNum,int nums){
        if(first == null || startNo < 1 || startNo > nums){
            System.out.println("参数输入有误！");
            return;
        }
        //创建辅助指针
        Boy helper = first;
        while(true){
            if(helper.getNext() == first){
                break;
            }
            helper = helper.getNext();
        }
        //让first和helper移动 startNo - 1 次
        for (int i = 0; i < startNo - 1; i++) {
            first = first.getNext();
            helper = helper.getNext();
        }
        while(true){
            if(helper == first){//说明只有一个节点了
                break;
            }
            for (int i = 0; i < countNum - 1; i++) {
                first = first.getNext();
                helper = helper.getNext();
            }
            //first指向的是出圈节点
            System.out.println("出圈no:"+first.getNo());
            first = first.getNext();
            helper.setNext(first);
        }
        System.out.println("最后节点的no:"+first.getNo());
    }
}

//创建一个Boy类表示一个节点
class Boy{
    private int no;
    private Boy next;

    public Boy(int no){
        this.no = no;
    }

    public int getNo() {
        return no;
    }

    public void setNo(int no) {
        this.no = no;
    }

    public Boy getNext() {
        return next;
    }

    public void setNext(Boy next) {
        this.next = next;
    }
}