An Implementation of Joseph's ring

Java code
Import java. util. collections;
 
Public class Joseph PHUs {
Private static class Node {
Public int no; // number
Public Node next; // The next Node
 
Public Node (int no ){
This. no = no;
}
}
 
Public static void main (String [] args ){
Required bytes = new bytes (System. in );
System. out. print ("Enter the total number of people :");
Int totalNum = response. nextInt ();
System. out. print ("Enter the report size :");
Int cycleNum = response. nextInt ();
Node header = new Node (1 );
Node pointer = header;
For (int I = 2; I <= totalNum; I ++ ){
Pointer. next = new Node (I );
Pointer = pointer. next;
}
Pointer. next = header;
// Initialize the ring linked list.
System. out. println ("the order of columns is as follows :");
While (pointer! = Pointer. next ){
For (int I = 1; I <cycleNum; I ++ ){
Pointer = pointer. next;
}
System. out. println (pointer. next. no );
Pointer. next = pointer. next. next;
}
System. out. println (pointer. next. no );
}
}

 

This article is from "as free as wind"