单向环形链表解决Josephu问题
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;
}
}
class CircleSingleLinkedList{
private Boy first = new Boy(-1);
public void addBoy(int nums){
if(nums<1){
System.out.println("nums值不正确");
return;
}
Boy curBoy = null;
for(int i=1 ; i<=nums;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 showBoy(){
if(first == null){
System.out.println("没有任何小孩");
return;
}
Boy curBoy = first;
while(true){
System.out.printf("小孩的编号 %d \n",curBoy.getNo());
if(curBoy.getNext()==first){
break;
}
curBoy = curBoy.getNext();
}
}
public void countBoy(int starNo, int countNum , int nums){
if(first == null || starNo<1 || starNo> nums){
System.out.println("参数有误,请重新输入");
return;
}
Boy helper = first;
while(true){
if(helper.getNext() == first ){
break;
}
helper = helper.getNext();
}
for(int j = 0; j <starNo -1 ; j++){
first = first.getNext();
helper = helper.getNext();
}
while(true){
if(helper == first){
break;
}
for(int j=0 ; j<countNum - 1 ; j++){
first = first.getNext();
helper = helper.getNext();
}
System.out.printf("小孩%d出圈\n",first.getNo());
first = first.getNext();
helper.setNext (first);
}
System.out.printf("最后留在权重的小孩编号%d \n",helper.getNo());
}
}