分别使用列表和队列来解决约瑟夫问题

import java.util.*;
public class text2
//用队列实现 
{
    public static void main(String[] args)
    {
        Scanner input = new Scanner (System.in);
        System.out.println("Enter the number of soldiers:");
        int numberPeople = input.nextInt();
        System.out.println("Enter the number of soldiers to skip:");
        int skip = input.nextInt();
        int count = 0;
        Queue<Integer> queue = new LinkedList<>();
        for(int num=1;num<=numberPeople;num++)
        {
            queue.add(num);
        }
        System.out.println("The order is:");
        while(queue.size()>=2)
        {
            count++;
            int temp = queue.poll();
            if(count%skip==0)
            {
                System.out.println("Soldier"+temp);
            }
            else
            {
                queue.add(temp);
            }
        }
        System.out.println("Alive:"+queue.poll());
        input.close();
    }
}

import java.util.*;
import java.util.Scanner;
public class Text 
{
    public static void main(String[] args)
    {
    //用列表实现
        int numberPeople, skip, targetIndex;
        List<String> list = new ArrayList<>();
        Scanner input = new Scanner (System.in);
        System.out.println("Enter the number of soldiers:");
        numberPeople = input.nextInt();
        input.nextLine();
        System.out.println("Enter the number of soldiers to skip:");
        skip = input.nextInt()-1;
        for(int count = 1; count<=numberPeople;count++)
        {
            list.add("Soldier"+count);
        }
        targetIndex = skip;
        System.out.println("this order is:");
        while(list.size()>=2)
        {
            System.out.println(list.remove(targetIndex));
            if(list.size()>0)
            {
                targetIndex = (targetIndex+skip)%list.size();
            }
        }
        input.close();
    }
}