约瑟夫环(C语言单链表实现)
题目要求:
具体代码:
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
int data;
struct node *next;
} Node;
Node *circle_create(int n);
void count_off(Node *head, int n, int k, int m);
int main() {
int n, k, m;
scanf("%d%d%d", &n, &k, &m);
Node *head = circle_create(n);
count_off(head, n, k, m);
return 0;
}
Node *circle_create(int n) {
Node *temp, *new_node, *head;
int i;
temp = (Node *) malloc(sizeof(Node));
head = temp;
head->data = 1;
for(i = 2; i <= n; i++) {
new_node = (Node *) malloc(sizeof(Node));
new_nod