源码网商城,靠谱的源码在线交易网站 我的订单 购物车 帮助

源码网商城

java 实现约瑟夫环的实例代码

  • 时间:2022-09-14 07:05 编辑: 来源: 阅读:
  • 扫一扫,手机访问
摘要:java 实现约瑟夫环的实例代码
[u]复制代码[/u] 代码如下:
import java.io.BufferedInputStream; import java.util.ArrayList; import java.util.List; import java.util.Scanner; public class Josephus {     private static class Node{         int No;         Node next;         public Node(int No){             this.No=No;         }     }     public static void main(String[] args) {         int totalNum,cycleNum;         List<Integer> list = new ArrayList<Integer>();         Scanner cin = new Scanner(new BufferedInputStream(System.in));         System.out.println("请输入总人数:");         totalNum=cin.nextInt();         System.out.println("请输入报数人数:");         cycleNum=cin.nextInt();         Node header = new Node(1);         Node pointer = header;         for(int i=2;i<=totalNum;i++){             pointer.next = new Node(i);             pointer = pointer.next;         }         pointer.next= header;         pointer=header;         while(pointer != pointer.next){             int i =2;             while(i<cycleNum){                 pointer = pointer.next;                 i++;             }             //list.add(pointer.next.No);             System.out.println("将序号"+pointer.next.No+"剔除。");             pointer.next=pointer.next.next;             pointer=pointer.next;         }         System.out.println("这是最后一个人:"+pointer.No);     } }
  • 全部评论(0)
联系客服
客服电话:
400-000-3129
微信版

扫一扫进微信版
返回顶部