-
Notifications
You must be signed in to change notification settings - Fork 28
Expand file tree
/
Copy pathfriend.cpp
More file actions
93 lines (76 loc) · 1.87 KB
/
Copy pathfriend.cpp
File metadata and controls
93 lines (76 loc) · 1.87 KB
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
#include<iostream>
#include<string>
using namespace std;
class WordNode {
private:
string word;
WordNode * next;
public:
explicit WordNode(const string & s) : word{s} {
next = nullptr;
}
friend class WordList;
friend ostream& operator<<(ostream& strm, const class WordList& m);
};
class WordList {
private:
int size;
WordNode * first;
WordNode * last;
public:
WordList() : size(0), first(nullptr), last(nullptr) {}
~WordList() {
WordNode *curr = first;
WordNode * ptr;
while (curr) {
ptr = curr;
curr = curr->next;
delete(ptr);
ptr = nullptr;
}
curr = nullptr;
first = nullptr;
last = nullptr;
}
void addToFront(string s);
void addToRear(string s);
bool isEmpty() const { return ( size == 0 ); }
friend ostream& operator<<(ostream& strm, const WordList& m);
};
void WordList::addToFront(string s) {
WordNode * newWordNode = new WordNode(s);
newWordNode->next = first;
first = newWordNode;
size++;
if (size == 1) {
last = first;
}
}
void WordList::addToRear(string s) {
WordNode * newWordNode = new WordNode(s);
if (isEmpty()) {
addToFront(s);
}
else {
last->next = newWordNode;
last = newWordNode;
size++;
}
}
ostream& operator<<(ostream& strm, const WordList& m) {
WordNode * curr = m.first;
while (curr) {
strm << curr->word << " ";
curr = curr->next;
}
return strm;
}
int main () {
WordList words;
words.addToFront("Hello");
words.addToRear("World");
words.addToRear("goodbye");
words.addToFront("CSC220");
cout << words << endl;
return 0;
}