/ / 问题 描述: / / / / / / 输出 结果: / / 1 / / 2 / / 3 / / / / 4 / / Delete ---- 5 / / Delete ---- 7 / / D

/ / 问题 描述: / / / / / / 输出 结果: / / 1 / / 2 / / 3 / / / / 4 / / Delete ---- 5 / / Delete ---- 7 / / Delete ---- 9 / / Delete ---- 11 / / Delete ---- 13 / / Delete ---- 2 / / Delete ---- 4 / / Delete ---- 8 / / Delete ---- 12 / / Delete ---- 3 / / Delete lecoultre atmos clock ---- 10 / / Delete ---- 6 / / Delete ---- 1 / / / / 循环 队列, 依次 删除 # include <stdio.h> # include <stdlib.h> typedef struct Node { int num; Node * pNext;} Node * LinkList; void Foo (int n, int k, int m) {LinkList p, ass, rear, p = (LinkList) malloc (sizeof (Node)) p -> num = 1, p -> pNext = p, rear = p, for (int i = 2, i <= n, i + +) {Node * temp = (Node *) malloc (sizeof (Node)) temp -> num = i; rear -> pNext = temp, temp -> pNext = p, rear = temp;} / / Node * t = p / / while (n -) / / {/ / printf ("% d" , t-> num) / / t = t-> pNext / /} / / printf ("\ n"); ass = p, for (int i = 1; i <k, i + +) {printf ("% d \ n", cur -> num) cur = cur -> pNext;} printf ("\ lecoultre atmos clock n% d \ n", cur -> num); Node * del = NULL; while (n - ) {for (int i = 1; i <m - 1, i + +, cur = cur -> pNext) del = cur -> pNext; ass -> pNext = del -> pNext, cur = cur -> pNext , printf ("Delete ----% d \ n", del -> num); del -> pNext = NULL, free (del);}} int main () {Foo (13, 4, 2) system ("pause");}