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

06_PrintListInReversedOrder.cpp

void PrintListReversingly_Iteratively(ListNode *pHead) {
    std::stack<ListNode*> nodes;
    // 注意理解指向指针的指针
    ListNode *pNode = pHead;
    while(pNode != nullptr) {
        nodes.push(pNode)
        pNode = pNode->m_pNext;
    }
    while(!nodes.empty()) {
        pNode = nodes.top();
        printf("%d\t", pNode->m_nValue);
        nodes.pop();
    }
}

void PrintListReversingly_Recursively(ListNode *pHead) {
    if(pHead != nullptr) {
        if(pHead->m_pNext != nullptr) {
            PrintListReversingly_Recursively(pHead->m_pNext);
        }
        printf("%d\t", pHead->m_nValue);
    }
}