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

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

#include <iostream>
#include <stack>

using namespace std;

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

void printList(ListNode *head) {
if (head == NULL)
return;
stack<ListNode *> ls;
while (head != NULL) {
ls.push(head);
head = head->m_pNext;
}
while (!ls.empty()) {
cout << ls.top()->m_nKey << " ";
ls.pop();
}
cout << endl;
}

ListNode *CreateList() {
ListNode *head = new ListNode;
if (cin >> head->m_nKey)
head->m_pNext = CreateList();
else
return NULL;
return head;
}

int main(int argc, char const *argv[]) {
ListNode *head = CreateList();
printList(head);
return 0;
}