class List: edit from old code: add comment insize class

  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
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
#include <iostream>
#include <stack>
class List {
struct node {
int data;
node* next;
};
/**
* pointer to first item of list
*/
node* top;
public:
/**
* Default constructor
*/
List();
/**
* Default destructor
*/
~List();
/**
* Add more item in the list
*
* @return void
*/
void push(int);
/**
* I think, this function should be push in destructor. But this is simple example.
* I want to show clearly how it work
*
* @return void
*/
void clear();
/**
* reverse the list
*
* @use std::stack
* @return void
*/
void reverse();
/**
* Get the last item in the list and delete it from list
*
* @param
* @return int, value of node
*/
int pop();
/**
* print all node of list
*
* @return void
*/
void print();
/**
* Search node in the list
*
* @return node*
*/
List::node* search(int);
};
List::List() {
top = NULL;
}
List::~List() {
}
void List::push(int item) {
node* m = new node;
m->next = NULL;
m->data = item;
node* last;
if (NULL == top) {
top = m;
} else {
node* temp = top;
while (NULL != temp) {
last = temp;
temp = temp->next;
}
last->next = m;
}
}
int List::pop() {
if (top == NULL) return 0;
node* last;
node* temp = top;
while (NULL != temp->next) {
last = temp;
temp = temp->next;
}
int saved = temp->data;
last->next = NULL;
delete temp;
return saved;
}
void List::reverse() {
node* temp = top;
std::stack<node*> stck;
while (NULL != temp) {
stck.push(temp);
temp = temp->next;
}
top = NULL;
while (!stck.empty()) {
push(stck.top()->data);
stck.pop();
}
}
void List::print() {
if (NULL == top) {
std::cout << "End Of List" << std::endl;
} else {
std::cout << top->data << "->";
top = top->next;
print();
}
}
List::node* List::search(int key) {
node* temp = top;
while (key != temp->data) {
temp = temp->next;
if (NULL == temp) {
return NULL;
}
}
return temp;
}
void List::clear() {
while (NULL != top) {
node* saved = top;
top = top->next;
delete saved;
}
}
int main() {
List t;
t.push(5);
t.push(6);
t.push(7);
t.push(8);
std::cout << t.pop() << std::endl;
t.reverse();
std::cout<<t.search(6)->data<<std::endl;
t.print();
t.clear();
return 0;
}