单向链表反转（循环和递归）_单向递归-优快云博客

本文介绍了一种使用C语言实现链表创建及两种反转方法：迭代和递归的方式。通过具体的代码示例展示了如何构建单向链表，并对其进行了正向和反向遍历。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include "stdio.h" #include "stdlib.h" typedef struct List { int data; struct List *next; }List; List* list_Create(void) { List *head, *tail, *p; int e; head = (List*)malloc(sizeof(List)); tail = head; printf("/nList Create, input Num(end of 0):"); scanf("%d",&e); while(e) { p=(List*)malloc(sizeof(List)); p->data=e; tail->next=p; tail=p; scanf("%d",&e); } tail->next = NULL; return head; } List *list_reverse(List *head) { List *p,*q,*r; p=head; q=p->next; while(q!=NULL) { r = q->next; q->next=p; p=q; q=r; } head->next = NULL; head=p; return head; } List *reverse(List *oldList,List *newHead=NULL) { List* next=oldList->next; oldList->next=newHead; newHead=oldList; return (next==NULL) ? newHead : reverse(next,newHead); } int main() { List *head, *p; int d; head=list_Create(); printf("/n"); for(p=head->next;p!=NULL;p=p->next) printf("--%d--",p->data); head = list_reverse(head); printf("/n"); for(p=head;p->next!=NULL;p=p->next) printf("--%d--",p->data); printf(" /n递归反转/n"); head = reverse(head,NULL); for(p=head;p->next!=NULL;p=p->next) printf("--%d--",p->next->data); system("pause"); return 0; }