面试题5：从尾到头打印链表

先询问面试官能够改变原链表的内容，如果不行的话

思路1:将每个结点依次push到栈中，在依次出栈

思路2:用函数递归来实现

#include <iostream>
#include <cstdio>
#include <stack>
using namespace std;

struct ListNode
{
    int m_nValue;
    ListNode *m_pNext;
};

ListNode* creatList(int value);
void AddToTail(ListNode **pHead, int value);
void ShowList(ListNode *pHead);
void ShowListReversingly_Iteratively(ListNode *pHead);
void ShowListReversingly_Recursively(ListNode *pHead);

int main()
{
    ListNode *p = NULL;
    AddToTail(&p, 10);
    AddToTail(&p, 20);
    AddToTail(&p, 30);
    AddToTail(&p, 50);
    AddToTail(&p, 40);

    ShowList(p);
    ShowListReversingly_Recursively(p);

    return 0;
}

void AddToTail(ListNode **pHead, int value){
    ListNode *pNew = new ListNode();
    pNew->m_nValue = value;
    pNew->m_pNext = NULL;
    if(*pHead == NULL)
    {
        *pHead = pNew;
    }
    else
    {
        ListNode *p = *pHead;

        while(p->m_pNext != NULL)
        {
            p = p->m_pNext;
        }
        p->m_pNext = pNew;
    }
}

ListNode* creatList(int value){
    ListNode *pHead = new ListNode();
    pHead->m_nValue = value;
    return pHead;
}

void ShowList(ListNode *pHead){
    if(pHead == NULL)
        return;
    ListNode *p = pHead;
    while(p->m_pNext != NULL)
    {
        cout<<p->m_nValue<<" ";
        p = p->m_pNext;
    }
    cout<<p->m_nValue<<endl;
}

void ShowListReversingly_Iteratively(ListNode *pHead){
    if(pHead == NULL)
        return;

    stack<ListNode*> nodes;
    ListNode *p = pHead;

    while(p != NULL)
    {
        nodes.push(p);
        p = p->m_pNext;
    }

    while(!nodes.empty())
    {
        p = nodes.top();
        cout<<p->m_nValue<<" ";
        nodes.pop();
    }
    cout<<endl;
}
void ShowListReversingly(ListNode *pHead);void ShowListReversingly(ListNode *pHead);

void ShowListReversingly_Recursively(ListNode *pHead){
    if(pHead != NULL)
    {
        if(pHead->m_pNext != NULL)
        {
            ShowListReversingly_Recursively(pHead->m_pNext);
        }

        cout<<pHead->m_nValue<<" ";
    }
}