满意答案
ericleeled
2016.01.15
采纳率:53% 等级:9
已帮助:766人
正好手头有代码。。。123456789101112131415161718192021222324252627282930313233343536373839#include #include typedef struct _node { int data; struct _node *next;} Node; int main() { int n, i, maxNum = 2, num = 1; scanf("%d", &n); Node *head = (Node*)malloc(sizeof(Node)); head->next = NULL; for(i = n; i > 0; i--) { Node *p = (Node*)malloc(sizeof(Node)); p->data = i; p->next = head->next; head->next = p; } Node *cur = head; while(head->next->next->next->next) { if(cur->next) { if(num == maxNum) { cur->next = cur->next->next; } else { cur = cur->next; } num = num % maxNum + 1; } else { num = 1; maxNum = 5 - maxNum; cur = head; } } for(cur = head->next; cur; cur = cur->next) { printf("%d\n", cur->data); } return 0;}
14分享举报