package com.ohana.josephu;import java.util.ArrayList;
import java.util.List;/*** 约瑟夫问题的java解决方案之一* * @author Ohana* @date 2013-09-07*/
public class JosephuProblem {private List<String> list = new ArrayList<String>();// 存储输出结果private List<String> resultRlist = new ArrayList<String>();public List<String> getList() {return list;}public List<String> getResultRlist() {return resultRlist;}public static JosephuProblem getInstance() {JosephuProblem jp = new JosephuProblem();// 初始化集合中的数据jp.init();return jp;}/*** 初始化数据*/private void init() {this.list.add("卡卡");this.list.add("哈马西克");this.list.add("莫德里奇");this.list.add("皮尔洛");this.list.add("蒂亚戈.席尔瓦");this.list.add("巴神");this.list.add("伊布");this.list.add("卡瓦尼");this.list.add("费莱尼");this.list.add("小法老");this.list.add("厄齐尔");}/**** 约瑟夫问题的计算* @param startPoint*            开始位置* @param distance*            间距*/private void reduce(int startPoint, int distance) {// 开始位置不能小于下阕（0）或者大于上阕（list.size()-1）if (startPoint < 0 || startPoint > list.size() - 1) {System.out.println("开始位置不存在");return;}// distance不能为负数if (distance < 0) {System.out.println("间距不能小于0");return;}// 集合不能没有数据if (list.size() < 1) {System.out.println("list中尚未初始化数据");return;}// 每次计数开始的索引int startIndex = startPoint;// 删除的位置int removeIndex;while (list.size() > 0) {// 【起始位置】+【间距】-1 =【len】int len = startIndex + distance - 1;// 如果 len > list.size();if (len > list.size() - 1) {removeIndex = len % list.size();} else {removeIndex = len;}String rmElement = list.remove(removeIndex);resultRlist.add(rmElement);startIndex = removeIndex;}}public static void main(String[] args) {JosephuProblem jp = JosephuProblem.getInstance();System.out.println("处理前的顺序");for (int i = 0; i < jp.getList().size(); i++) {String item = jp.getList().get(i);System.out.print(item + " , ");}System.out.println();jp.reduce(2, 3);System.out.println("处理后的顺序");for (int i = 0; i < jp.getResultRlist().size(); i++) {String item = jp.getResultRlist().get(i);System.out.print(item + " , ");}}}