-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSList.cpp
92 lines (83 loc) · 2.23 KB
/
SList.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
#ifndef SINGLELIST_CPP
#define SINGLELIST_CPP
#include <bits/stdc++.h>
#include "Node.cpp"
using namespace std;
template<class Keys, class T>
class SingleList{
private:
Node<Keys, T> *header;
Node<Keys, T> *trailer;
long sz;
public:
SingleList() : header(NULL), trailer(NULL), sz(0) {}
~SingleList() {
while (header != nullptr) {
Node<Keys, T>* temp = header;
header = header->getNext();
delete temp;
}
}
long size(){
return sz;
}
int isEmpty(){
return sz == 0;
}
Node<Keys, T>* getHead(){
return header;
}
Node<Keys, T>* getNode(Keys k) {
Node<Keys, T>* p = header;
while (p != NULL && p->getKey() != k) {
p = p->getNext();
}
return p;
}
Node<Keys, T>* pushback(Keys k, T e) {
Node<Keys, T>* q = new Node<Keys, T>;
q->setKey(k);
q->setElem(e);
if (header == NULL) {
header = q;
trailer = q;
} else {
trailer->setNext(q);
trailer = q;
}
sz++;
return q;
}
void replace(Node<Keys, T> *p, Keys k, T e){
p->setKey(k);
p->setElem(e);
}
void remove(Node<Keys, T> *p){
Node<Keys, T> *p1;
if(p == header){
if(size() == 1){
header = NULL;
trailer = NULL;
}else{
header = header->getNext();
}
sz--;
}else{
p1 = header;
while(p1->getNext() != p){
p1 = p1->getNext();
}
if(p1 != NULL){
if(p != trailer){
p1->setNext(p->getNext());
}else{
trailer = p1;
p1->setNext(NULL);
}
sz--;
}
}
delete p;
}
};
#endif