AlgorithmCode/list.cpp at master · ZMK112/AlgorithmCode · 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
60
61
62
63
#include <iostream>
#include <string>
#include <vector>
#include <stack>
using namespace std;

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

void add_tail(Listnode* &head, int value)
{
    Listnode* newNode = new Listnode();
    newNode->val = value;
    newNode->next = NULL;

    if(head == NULL){
        head = newNode;
    }
    else{
        Listnode* p = head;
        while (p->next != NULL)
        {
            p = p->next;
        }
        p->next = newNode;
    }
}

vector<int> reversePrint(Listnode* head)
{
    stack<Listnode*> nodes;
    Listnode* p = head;
    while (p != nullptr)
    {
        nodes.push(p);
        p = p->next;
    }
    while (!nodes.empty())
    {
        p = nodes.top();
        printf("%d\t",p->val);
        nodes.pop();
    }

}


int main()
{
    Listnode* head =NULL;
    add_tail(head, 10);
    if (head != NULL)
    {
        cout << head->val << endl;
    }
    else
    {
        cout << "head is null"<<endl;
    }
    return 0;
}