요셉 링순환 체인 테이블 실현

n, m 입력n명, 매번 m번째 사람이 나열한다

#include<iostream>
using namespace std;
class Node {
public:
    int data;
    Node* next;
    Node(int _data) {
        data = _data;
        next = NULL;
    }
};
class LinkList {
private:
    Node* head;
public:
    LinkList() {
        head = NULL;
    }
    void insert(Node *node, int index) {
        if (head == NULL) {
            head = node;
            head->next = head;
            return;
        }
        if (index == 0) {
            node->next = head->next;
            head->next = node;
            return;
        }
        Node *current_node = head->next;
        int count = 0;
        while (current_node != head && count < index - 1) {
            current_node = current_node->next;
            count++;
        }
        if (count == index - 1) {
            node->next = current_node->next;
            current_node->next = node;
        }
        if (node == head->next) {
            head = node;
        }
    }
    void output_josephus(int m){
        Node *current_node=head;
        while(current_node->next!=current_node){
            for(int i=1;i<m;i++){
                current_node=current_node->next;
            }
            cout<<current_node->next->data<<" ";
            Node *delete_node=current_node->next;
            current_node->next=current_node->next->next;
            delete delete_node;
        }
        cout<<current_node->data<<endl;
        delete current_node;
    }
};
int main() {
    LinkList linklist;
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        Node *node = new Node(i);
        linklist.insert(node, i - 1);
    }
    linklist.output_josephus(m);
    return 0;
}