public class Josepfu {
public static void main(String[] args) {
// CircleSingleLinkedList list = new CircleSingleLinkedList();
// list.addBoy(5);
list.showboy();
// list.countboy(1, 2, 5);
System.out.println(index(5,2));
}
public static Object index(int nums,int count) {
if(nums<0) {
return 0;
}
if(nums==1) {
return 1;
}
List list=new ArrayList();
for(int i=1;i<=nums;i++) {
list.add(i);
}
int index=0;
while(list.size()>1)
{
index=(index+count-1)%(list.size());
list.remove(index);
}
return list.get(0);
}
}
class CircleSingleLinkedList {
// 利用三个指针配合构建
private Boy first = null;
public void addBoy(int nums) {
if (nums < 1) {
System.out.println("人数不够,怎么玩");
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 temp = first;
while (true) {
System.out.println("小孩编号" + temp.getNo());
if (temp.getNext() == first) {
break;
}
temp = temp.getNext();
}
}
public void countboy(int startNo,int count,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();
}
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<count-1;i++) {
first=first.getNext();
helper=helper.getNext();
}
System.out.println("小孩"+first.getNo()+"出圈");
first=first.getNext();
helper.setNext(first);
}
System.out.println("最后一个出圈的小孩"+first.getNo());
}
}
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;
}
}
约瑟夫环链表实现
最新推荐文章于 2024-07-24 15:50:22 发布