每天一个小算法（3）----倒序打印链表

这个比较简单，用栈、递归、倒转链表都可以实现，不再过多解释。

代码使用递归实现

#include <stdio.h>
#include <time.h>
#include <stdlib.h>
typedef struct Node
{
    int data;
    Node* next;
}Node, *List;


List createList(int num) //随机生成数字，构造链表
{
    List aList = (List)malloc(sizeof(Node));
    aList->next = NULL;
    aList->data = 0;
    Node* qT = aList;

     // srand((int)time(0));
     for ( int i=0; i< num; ++i)
     {
         Node* pTN = (Node*)malloc(sizeof(Node));
         pTN->data = rand()%100;
         pTN->next = NULL;
         qT->next = pTN;
         qT = pTN;
     }
     return aList;
}

void printList(List aList)    //正序打印链表
{
    if ( aList == NULL || aList->next == NULL )
        return;

    Node* pT = aList->next;
    printf("element of the list:
	");
    while( pT != NULL )
    {
        printf("%d ", pT->data);
        pT = pT->next;
    }

    printf("
");
}

void reversePrintList(List aList)    //倒序打印链表
{
    if ( aList == NULL )
        return;

    reversePrintList(aList->next);
    printf("%d ", aList->data);
}

void deleteList(List aList)    //删除链表
{}

int main(int argc, char const *argv[])
{
     srand((int)time(0));
    List aList = createList(7);
    printList(aList);
    printf("reverse print the list:
	");
    reversePrintList(aList->next);
    printf("
");

    deleteList(aList);
    
    return 0;
}