java 实现约瑟夫环

来源：互联网发布：武汉理工大网络继续编辑：程序博客网时间：2024/04/29 04:49

约瑟夫环是一个循环队列

N个人围成一个环，从第1个开始报数，每报到K的时候，K出列

求出列顺序和最后剩下的那个人

package Josephus;import java.util.ArrayList;import java.util.List;public class Josephus {public List<Integer> sourceList = new ArrayList<Integer>(); //原始队列public List<Integer> finalList = new ArrayList<Integer>();//最终出队队列public int k;//报数第k 个人出队public int n;//n 一共n 个人public void init(int k, int n){this.k = k;this.n = n;//初始化原始队列for (int i = 1; i <= n; i ++){sourceList.add(i);}}public void sequence() {int index = 0; //原始队列报数指针，指向当前报数人while (sourceList.size() > 0){for (int count = 1; count <= k; count++) {//count为报数if (sourceList.size() == 1){//原始队列只有一人，则赋值后退出循环finalList.add(sourceList.get(0));sourceList.remove(0);break;}if (index == sourceList.size()){//报数的人和原始队列人数相同，此队列已经报完一次，回到0位开始index = 0;} else {index = index % (sourceList.size());//从index取余开始报数}if (count != k){//报数没报到k，index 后移一位index ++;} else {//报数到k，移除元素，重新报数finalList.add(sourceList.get(index));sourceList.remove(index);break;}}}System.out.println(finalList.toString());}public static void main(String[] args) {   Josephus josephus = new Josephus();josephus.init(3, 20);josephus.sequence();}}

参考页面：http://blog.csdn.net/yinshuiy/article/details/5861538