CodingInterviews/5_PrintListReversingly2.cpp at master · wjmj/CodingInterviews · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <iostream>
#include <stack>

using namespace std;

struct ListNode
{
    int mValue;
    ListNode* pNext;
};

void PrintListReversingly(ListNode* head)
{
    if (head != NULL)
    {
        stack<int> s;
        ListNode* p = head;
        while (p)
        {
            s.push(p->mValue);
            p = p->pNext;
        }


        while (!s.empty())
        {
            cout << s.top() << endl;
            s.pop();
        }
    }


}
void CreateList(ListNode** pHead, int* nums, int length)
{
    if (nums != NULL && length > 0)
    {
        *pHead = NULL;
        for (int i = length - 1; i >= 0; i--)
        {
            ListNode* pNew = new ListNode();
            pNew->mValue = nums[i];
            pNew->pNext = *pHead;
            *pHead = pNew;
        }
    }
}
int main()
{
    ListNode* head1 = NULL;
    int nums1[] = {1};
    CreateList(&head1, nums1, 1);
    PrintListReversingly(head1);

    ListNode* head2;
    int nums2[] = {1, 2, 3, 4, 5, 6, 7, 8};
    CreateList(&head2, nums2, 8);
    PrintListReversingly(head2);
}