约瑟夫环_循环链表JAVA解答

创建数据结构链表类LinkedListpublic class LinkedList { public Node head;//头节点 public Node tail;//尾巴节点 public int size;//节点数 public LinkedList() { this.head = this.tail = null; } public void addNode(int data){ if(head == null){ head = new Node(data); tail = head; tail.next = head; //代表是循环列表 size++; return; } tail.next = new Node(data); tail = tail.next; tail.next = head; size++; } public void print(){ Node tempNode = head; for(int i = 0;i

编写测试案例public class Cicle { @Test public void test() { LinkedList linkedList = new LinkedList(); linkedList.addNode(0); linkedList.addNode(1); linkedList.addNode(2); linkedList.addNode(3); linkedList.addNode(4); //linkedList.print(); Scanner scanner = new Scanner(System.in); int m = scanner.nextInt(); Node tempNode = linkedList.tail; while(tempNode!=tempNode.next){//这是表示只剩下一个节点的情况 for(int i = 0;i