java使用链表实现约瑟夫环

package com.dm.test;
 
public class Test2
{
 public static void main(String[] args)
 {
 //头结点
 Node root = new Node(1);
 int[] order = build(root,9,5);
 for(int i =0;i<order.length;i++)
 {
 System.out.print(order[i]+" ");
 }
 }
 //将约瑟夫环建成一个链表
 public static int[] build(Node root,int n, int m)
 {
 Node current = root;
 for(int i = 2; i<=n; i++)
 {
 Node node = new Node(i);
 current.next = node;
 current = node;
 }
 current.next = root;
 int[] order = come(root,n,m);
 return order;
 }
 //出队列
 //结束条件：只有一个结点时，这个结点的next是它自身
 //将出来的数，放在一个数组中，遍历数组就是出队序列
 public static int[] come(Node root,int n, int m)
 {
 int[] order = new int[n];
 int j = 0;
 Node p = root;
 while(p.next!=p)
 {
 int i = 1;
 while(i<m-1)
 {
 p=p.next;
 i++;
 }
 if(i==m-1)
 {
 order[j]=p.next.data;
 j++;
 p.next = p.next.next;
 p=p.next;
 }
 }
 order[j]=p.data;
 return order;
 }
}
class Node
{
 int data;
 Node next;
 public Node(int data)
 {
 this.data = data;
 next= null;
 }
}