剑指Offer面试题5[从尾到头打印链表]

1. 题目描述：

2. 相关知识：

3. 解答思路：

4. 代码实现：

#include "stdafx.h"
#include <stack>
using namespace std;

struct ListNode {
int val;
struct ListNode *next;
};

void printListFromTailToHead(ListNode* head) {
stack<ListNode *> nodes;
ListNode *pNode = head;
while(pNode!=NULL)
{
nodes.push(pNode);
pNode = pNode->next;
}
while(!nodes.empty())
{
pNode = nodes.top();
printf("%d\t",pNode->val);
nodes.pop();
}
}

void Recursive_print(ListNode* head) {
if(head!=NULL)
{
if(head->next != NULL)
{
Recursive_print(head->next);
}
printf("%d\t",head->val);
}
}

struct ListNode *make_node(int val)
{
struct ListNode *node = (ListNode*) malloc(sizeof(ListNode));
node->val = val;
node->next = NULL;
return node;
}

int _tmain(int argc, _TCHAR* argv[])
{
struct ListNode *head = NULL;
struct ListNode *pNode = NULL;
struct ListNode *node = NULL;
node = make_node(1);
head = node;
pNode = node;
node = make_node(2);
pNode->next = node;
pNode = node;
node = make_node(3);
pNode->next = node;
pNode = node;
node = make_node(4);
pNode->next = node;
pNode = node;

Recursive_print(head);
printListFromTailToHead(head);
return 0;
}