public class Josepfu {
public static void main(String[] args) {
JosepfuQue(10,3,1);
}
//Josepfu问题:n个小孩,从k个开始从1报数,报到m的小孩出列,下一个小孩继续从1开始报数
public static void JosepfuQue(int n,int k,int m){
CircleSingleLink c1 = new CircleSingleLink();
c1.addBoy(n);
Boy temp= c1.getFirst();
for (int i=1;i< k ;i++){//找到第k个小孩,为temp
temp=temp.getNext();
}
while (temp.getNext()!=temp){
if (m==1) {//m=1时
for (int i=0;i<n;i++){
System.out.println(temp.getNo());
temp=temp.getNext();
}
break;
}
for (int i=1;i<m-1;i++)//m>1时
temp=temp.getNext();//此时temp为出列的上一个小孩
Boy temp1=temp;
Boy temp2=temp1.getNext();
temp= temp.getNext().getNext();//temp1、temp2(出列)、temp
System.out.println(temp2.getNo());
temp1.setNext(temp);//删除出列的小孩
}
if (m!=1)
System.out.println(temp.getNo());
}
}
//创建单向环形链表
class CircleSingleLink{
private Boy first=null;
public Boy getFirst() {
return first;
}
//链表里添加对象
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;
}
}
}
//删去第no个结点
public void delete(int no){
if (first==null){
System.out.println("链表为空");
return;
}
Boy temp=first;
boolean flag=false;
while (true){
if (temp.getNext().getNo()==no){//找到了,待删除的结点不是最后一个
flag=true;
break;
}
if (temp.getNext()==first&&temp.getNo()!=no)//没找到
break;
temp=temp.getNext();
}
if (flag)
temp.setNext(temp.getNext().getNext());
else
System.out.println("删除失败");
}
//遍历链表
public void showList(int n){
if (first.getNext()==null){
System.out.println("链表为空");
return;
}
Boy curBoy=first;
while (curBoy.getNext()!=first){
System.out.println("小孩的编号是"+curBoy.getNo());
curBoy=curBoy.getNext();
}
System.out.println("小孩的编号是"+curBoy.getNo()+n);
}
//老师的写法
public void Jose(int startNo,int countNum,int nums){
Boy helper=first;
while (true){
if (helper.getNext()==first){
break;
}
helper=helper.getNext();
}
for (int j=0;j<startNo-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.println(first.getNo());
first=first.getNext();
helper.setNext(first);
}
System.out.println(helper);
}
}
//结点Boy
class Boy{
private int no;
private Boy next;
public Boy(int no){
this.no=no;
}
public int getNo() {
return no;
}
public Boy getNext() {
return next;
}
public void setNext(Boy next) {
this.next = next;
}
@Override
public String toString() {
return "Boy{" +
"no=" + no +
'}';
}
}
环形链表+Josepfu问题
最新推荐文章于 2023-05-14 18:05:47 发布