-
Notifications
You must be signed in to change notification settings - Fork 0
/
02_BasicLinkedList.cpp
95 lines (80 loc) · 1.57 KB
/
02_BasicLinkedList.cpp
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
#include <iostream>
using namespace std;
class Node {
public:
Node(int d, Node *n = NULL, Node *p = NULL)
: data(d), next(n), prev(p) {}
int data;
Node *next;
Node *prev;
};
class List {
public:
List();
~List();
void print();
void push_front(int x);
void push_back(int x);
Node* head() { return _head; }
Node* last() { return _last; }
void clear();
private:
Node* _head;
Node* _last;
};
List::List() {
_head = NULL;
_last = NULL;
}
void List::print() {
for (Node* p = _head; p != NULL; p = p->next)
cout << p->data << ' ';
}
void List::push_front(int x) {
Node *new_node = new Node(x);
new_node->next = _head;
if (_head != NULL)
_head->prev = new_node;
_head = new_node;
if (_last == NULL)
_last = new_node;
}
void List::push_back(int x) {
if (_head == NULL)
push_front(x);
else {
Node *new_node = new Node(x);
new_node->prev = _last;
_last->next = new_node;
_last = new_node;
}
}
List::~List() {
clear();
}
void List::clear() {
Node *p = _head;
while (p != NULL) {
Node *q = p;
p = p->next;
delete q;
}
_head = NULL;
_last = NULL;
}
int main() {
List l;
l.push_back(86);
l.push_front(43);
l.push_front(12);
l.print();
cout << endl;
int sum = 0;
for (Node* p = l.head(); p != NULL; p = p->next)
sum += p->data;
cout << sum << endl;
List l2;
l2.push_back(1);
l2.push_back(2);
l2.push_back(3);
}