解题思路:
注意事项:
参考代码:
#include <stdio.h> #include <stdlib.h> typedef struct no { int id; struct no *next; } N1; N1 *Init(int n); void output(N1 *a, int m); int main() { int n, m; N1 *one; while(scanf("%d%d", &n, &m)!=EOF){ one = Init(n); output(one, m); free(one); } return 0; } N1 *Init(int n) { N1 *a = (N1 *)malloc(sizeof(N1)); N1 *h = a, *p; for (int i = 1; i <= n; i++) { p = (N1 *)malloc(sizeof(N1)); p->id = i; p->next = NULL; h->next = p; h = h->next; p = NULL; } h->next = a->next; return a; } void output(N1 *a, int m) { N1 *h, *p; p = a->next; free(a); do { for (int i = 1; i <= m; i++) { if (i == m) { h->next = p->next; free(p); p = h->next; } else { h = p; p = p->next; } } } while (h->next != h); printf("%d", h->id); free(h); }
0.0分
0 人评分
C语言程序设计教程(第三版)课后习题5.4 (C语言代码)浏览:1293 |
WU-判定字符位置 (C++代码)浏览:1407 |
简单的a+b (C语言代码)浏览:528 |
剪刀石头布 (C语言代码)浏览:754 |
WU-C语言程序设计教程(第三版)课后习题12.1 (C++代码)浏览:941 |
C语言程序设计教程(第三版)课后习题6.6 (C语言代码)浏览:350 |
【矩阵】 (C++代码)浏览:950 |
IP判断 (C语言描述,蓝桥杯)浏览:1095 |
文科生的悲哀 (C语言代码)浏览:1402 |
数列排序 (C语言代码)浏览:617 |