package shuJuJieGouYuSuanFa.lianBiao;
/**
* @ClassName JOsepfu
* @Author 瞿肖
* @Date 2022/7/28 20:08
*/
public class Josepfu {
public static void main(String[] args) {
LikedListJosepfu a = new LikedListJosepfu();
a.addBoy(5);
// a.showBoy();
a.getBoy(1,2,5);
}
}
class LikedListJosepfu {
private Boy first = null;
public void getBoy(int start, int k, int nums) {
if (first == null || start < 1 || start > nums) {
System.out.println("数据有误");
return;
}
Boy t = first;
//t是为了删除节点是使用,让t走到第一个孩子的后面
while (true) {
if (t.getNext() == first) {
break;
}
t = t.getNext();
}
//开始数人的开始小孩
for (int i = 0; i < start - 1; i++) {
first = first.getNext();
t = t.getNext();
}
//开始点名
while (true) {
if (t == first) {
break;
}
//k是第几个出列
for (int i = 0; i < k - 1; i++) {
first = first.getNext();
t = t.getNext();
}
//出列
System.out.println(first.getNo());
first = first.getNext();
t.setNext(first);
}
//最后一个人
System.out.println(first.getNo());
}
public void addBoy(int nums) {
if (nums <= 0) {
System.out.println("数据有误!");
return;
}
Boy t = null;
for (int i = 1; i <= nums; i++) {
Boy boy = new Boy(i);
if (i == 1) {
first = boy;
first.setNext(first);
t = first;
} else {
//添加人员
t.setNext(boy);
boy.setNext(first);
t = boy;
}
}
}
//显示
public void showBoy() {
if (first == null) {
System.out.println("为空");
return;
}
Boy t = first;
while (true) {
System.out.println("小孩的编号" + t.getNo());
if (t.getNext() == first) {
break;
}
t = t.getNext();
}
}
}
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;
}
}
单链表模拟约瑟夫环(Josepfu)
最新推荐文章于 2022-10-27 22:37:42 发布