031-从尾到头输出链表

// 031.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <malloc.h>
struct ListNode
{
	int				m_nKey;
	struct ListNode *m_pNext;
};

struct ListNode *CreatList(int number)
{
	struct ListNode *head = NULL;
	struct ListNode *cur  = NULL;
	struct ListNode *temp = NULL;
	
	head = (struct ListNode*)malloc(sizeof(struct ListNode));
	if (NULL == head)
	{
		return NULL;
	}
	head->m_nKey = 0;
	head->m_pNext = NULL;
	temp = head;
	
	printf("List data number %d\n", number);
	
	for (int i=0; i<number; i++)
	{
		cur = (struct ListNode*)malloc(sizeof(struct ListNode));
		if (cur == NULL)
		{
			return NULL;
		}
		printf("List Id%02d ", i);
		printf("Input data  ");
		scanf("%d", &cur->m_nKey);
		cur->m_pNext = NULL;
		if (i==0)
		{
			head = cur;
			temp = cur;
		}
		else
		{
			cur->m_pNext = NULL;
			temp->m_pNext = cur;
		}
		temp = cur;
	}
	return head;
}


void PrintListReversely(ListNode* pListHead)
{
      if(pListHead != NULL)
      {

            // Print the next node first
            if (pListHead->m_pNext != NULL)
            {
                  PrintListReversely(pListHead->m_pNext);
            }				
            // Print this node			
            printf("%d", pListHead->m_nKey);			
      }	  
}



int main(int argc, char* argv[])
{
	
	struct ListNode *pHead = NULL;
	pHead = CreatList(5);
	PrintListReversely(pHead);
	return 0;
}