n个人排成一圈，从1开始报数，数到3，退出，剩下的最后一个人

最新推荐文章于 2022-01-02 12:30:14 发布

mutu_du

最新推荐文章于 2022-01-02 12:30:14 发布

阅读量3.7k

点赞数 1

分类专栏：数据结构文章标签： integer class string list

本文链接：https://blog.csdn.net/d_x_program/article/details/7337171

版权

数据结构专栏收录该内容

4 篇文章 0 订阅

订阅专栏

package test;

import java.util.LinkedList;
import java.util.List;

public class Test4 {
public static void main(String[] args){
  Joesephe joesephe = new Joesephe();
  int count = 1 ;
  int index = 0 ;
  for( int i = 1 ; i < 11 ; i++){
   joesephe.addElemnet(i);
  }

  while(joesephe.getLength() != 1){
   if(joesephe.getElement(index) == 0){
    index = (index + 1) >= joesephe.getSize() ? 0 : (index + 1) ;
    continue;
   }
   if(count == 3){
    joesephe.changeElement(index, 0);
   }
   count = (count + 1) == 4 ? 1 : count + 1;
   index = (index + 1) >= joesephe.getSize() ? 0 : (index + 1) ;
  }
  for(int i = 0 ;i<joesephe.getSize() ; i++){
   if(joesephe.getElement(i) != 0 ){
    System.out.println(joesephe.getElement(i));
   }
  }
}
}
class Joesephe{
private List<Integer> list = new LinkedList<Integer>();
private int changCount = 0;
public void addElemnet(Integer element){
  list.add(element);
}
public void deleteElement(int index){
  list.remove(index);
}
public void changeElement(int index,Integer element){
  list.remove(index);
  list.add(index, element);
  changCount ++;
}
public Integer getLength(){
  return list.size() - changCount;
}
public Integer getSize(){
  return list.size();
}
public Integer getElement(int index){
  return list.get(index);
}

}