约瑟夫问题环形单链表

public class CircleSingleLinkedList {

private Boy first = null;

public void add(int num) {
    if (num < 1) {
        return;
    }
    Boy curBoy = null;
    for (int i = 1; i <= num; i++) {
        Boy boy = new Boy(i);
        if (i == 1) {
            first = boy;
            first.setNext(first);
            curBoy = first;
        } else {
            curBoy.setNext(boy);
            boy.setNext(first);
            curBoy = boy;
        }
    }
}

public void remove(int start, int count, int num) {
    if (first.getNext() == first || start < 1 || count < 1 || start > num) {
        return;
    }

    Boy helper = first;
    while (helper.getNext() != first) {
        helper = helper.getNext();
    }

    for (int i = 1; i < start; i++) {
        first = first.getNext();
        helper = helper.getNext();
    }

    while (true) {
        if (helper == first) {
            break;
        }
        for (int j = 1; j < count; j++) {
            first = first.getNext();
            helper = helper.getNext();
        }
        System.out.println(first);
        first = first.getNext();
        helper.setNext(first);
    }
    System.out.println(first);
}

public void list() {
    if (first == null) {
        return;
    }
    Boy curBoy = first;
    do {
        System.out.println(curBoy);
        curBoy = curBoy.getNext();
    } while (curBoy != first);
}

}

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;
}

@Override
public String toString() {
    return "Boy{" +
            "no=" + no +
            '}';
}

}