【java算法】约瑟夫问题求解

来源：互联网发布：usb摄像头拍照软件编辑：程序博客网时间：2024/05/28 17:07

解法一，用Liat来实现

<span style="font-family: Arial, Helvetica, sans-serif;"></pre><pre name="code" class="java">import java.util.ArrayList;  </span>import java.util.List;  import java.util.Scanner;  public class Yue {      public static void main(String[] args) {          Scanner scanner = new Scanner(System.in);          System.out.print("请输入总人数：");          int totalNum = scanner.nextInt();          System.out.print("请输入报数的大小：");          int cycleNum = scanner.nextInt();          System.out.println("请输入从第几个人开始报数：");        int startNum = scanner.nextInt();        yuesefu(totalNum, cycleNum,startNum);      }       public static void yuesefu(int totalNum, int countNum,int startNum) {          // 初始化人数          List<Integer> start = new ArrayList<Integer>();          for (int i = 1; i <= totalNum; i++) {              start.add(i);          }          //k为第一次开始时的下标        int k = startNum-1;          while (start.size() >0) {              k = k + countNum;   //第k位人            //第k人的索引位置              k = k % (start.size()) - 1;             // 判断是否到队尾              if (k < 0) {                  System.out.println(start.get(start.size()-1));                  start.remove(start.size() - 1);                  k = 0;              } else {                  System.out.println(start.get(k));                  start.remove(k);              }          }      }  }

0 0