java约瑟夫问题循环链表

循环链表是解决约瑟夫问题的一种常见方法。下面是一个使用Java循环链表解决约瑟夫问题的示例：

class Node {
    int data;
    Node next;

    public Node(int data) {
        this.data = data;
    }
}

class CircularLinkedList {
    private Node head;
    private Node tail;

    public void add(int data) {
        Node newNode = new Node(data);
        if (head == null) {
            head = newNode;
            tail = newNode;
            tail.next = head;
        } else {
            tail.next = newNode;
            tail = newNode;
            tail.next = head;
        }
    }

    public void remove(Node node) {
        if (head == null) {
            return;
        }
        if (head == node) {
            head = head.next;
            tail.next = head;
        } else {
            Node current = head;
            while (current.next != node) {
                current = current.next;
            }
            current.next = node.next;
            if (node == tail) {
                tail = current;
                tail.next = head;
            }
        }
    }

    public void josephus(int k) {
        Node current = head;
        while (current.next != current) {
            for (int i = 1; i < k; i++) {
                current = current.next;
            }
            System.out.print(current.data + " ");
            remove(current);
            current = current.next;
        }
        System.out.println(current.data);
    }
}

public class Main {
    public static void main(String[] args) {
        CircularLinkedList list = new CircularLinkedList();
        int n = 7; // 总人数
        int k = 3; // 报数为3的人出列
        for (int i = 1; i <= n; i++) {
            list.add(i);
        }
        System.out.println("出列顺序：");
        list.josephus(k);
    }
}

这段代码中，我们首先定义了一个`Node`类来表示循环链表的节点，然后定义了`CircularLinkedList`类来实现循环链表的操作。在`josephus`方法中，我们使用循环链表模拟约瑟夫问题的解决过程，每次找到第k个节点并移除，直到只剩下一个节点为止。