标签：node 递归 int 返回 printf def for == 逆置
#include<stdio.h> #include<stdlib.h> #define N 9 typedef struct node{ int data; struct node * next; }ElemSN; ElemSN * Createlink(int a[],int n) { int i; ElemSN * h=NULL, * p; for( i=N-1;i>=0;i--) { p=(ElemSN *)malloc(sizeof(ElemSN)); p->data =a[i]; p->next=h; h=p; } return h; } ElemSN* In_reverseList(ElemSN* H) { ElemSN * newHead ; if (H == NULL || H->next == NULL) //链表为空直接返回，而H->next为空是递归基 return H; newHead = In_reverseList(H->next); //一直循环到链尾 H->next->next = H; //翻转链表的指向 H->next = NULL; //记得赋值NULL，防止链表错乱 return newHead; //新链表头永远指向的是原链表的链尾 } void printlink(ElemSN * h) { ElemSN * p; for(p=h;p;p=p->next) printf("%d\n",p->data); } int main(void) { int a[N]={1,2,3,4,5,6,7,8,9}; ElemSN * head; head=Createlink(a,9); printlink(In_reverseList(head)); }标签：node 递归 int 返回 printf def for == 逆置
原文地址：http://blog.51cto.com/13645380/2157693
