Repository navigation
Expand file tree
/
Copy pathslist.cpp
More file actions
232 lines (196 loc) · 4.72 KB
/
Copy pathslist.cpp
File metadata and controls
232 lines (196 loc) · 4.72 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
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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
//实现带表头单链表及其基本操作
//Thu Jul 17 06:33:32 PDT 2014
#include <iostream>
#include <stack>
#include <assert.h>
using namespace std;
typedef struct LinkNode{
int data;
LinkNode * next;
}*LinkList;
//创建单链表
LinkList CreateList(int *arr, int n);
//打印单链表
void PrintList(LinkList head);
//倒序打印单链表
void PrintListReverse(LinkList head);
//新建链表节点
LinkNode* CreateNode(int value);
//删除链表中某个节点
//时间复杂度要求:O(1)
void DeleteNodeExist(LinkList head, LinkNode* node);
//删除链表中数据为给定某值的节点
void DeleteNodeWithValue(LinkList head, int value);
//获得链表中倒数第K个节点
LinkNode* GetLastKNode(LinkList head, int k);
//反转链表
LinkList ReverseList(LinkList head);
//合并两个已排序链表
LinkList MergeList(LinkList aHead, LinkList bHead);
int main()
{
int a[] = {1, 3, 5, 7};
int b[] = {2, 4, 6, 8};
LinkList aList = CreateList(a, sizeof(a) / sizeof(int));
LinkList bList = CreateList(b, sizeof(b) / sizeof(int));
//PrintList(aList);
//PrintListReverse(aList);
//ReverseList(aList);
//PrintList(aList);
//cout << GetLastKNode(aList, 2)->data;
ReverseList(aList);
ReverseList(bList);
PrintList(aList);
PrintList(bList);
LinkList cList = MergeList(aList, bList);
PrintList(cList);
DeleteNodeWithValue(cList, 8);
PrintList(cList);
LinkNode *pos = cList;
while(pos->next != NULL)
pos = pos->next;
DeleteNodeExist(cList, pos);
PrintList(cList);
return 0;
}
//头插法创建单链表
LinkList CreateList(int *arr, int n)
{
assert(arr != NULL && n > 0);
LinkNode *head = new LinkNode;
LinkNode *newNode;
head->next = NULL;
for (int i=0; i<n; ++i) {
newNode = new LinkNode;
newNode->data = *(arr + i);
newNode->next = head->next;
head->next = newNode;
}
return head;
}
//打印单链表
void PrintList(LinkList head)
{
cout << "打印单链表" << endl;
LinkNode *pos = head->next;
while (pos != NULL)
{
cout << pos->data << " ";
pos = pos->next;
}
cout << endl;
}
//倒序打印单链表
void PrintListReverse(LinkList head)
{
stack<LinkNode *> st;
LinkNode *pos = head->next;
while (pos != NULL)
{
st.push(pos);
pos = pos->next;
}
cout << "逆向打印单链表" << endl;
while (!st.empty())
{
cout << st.top()->data << " ";
st.pop();
}
cout << endl;
}
//删除链表中某个节点
//时间复杂度要求:O(1)
void DeleteNodeExist(LinkList head, LinkNode* node)
{
assert(head->next != NULL && node != NULL);
LinkNode *behind = node->next;
if (behind == NULL)
{
LinkNode *prev = head;
while (prev->next != node)
prev = prev->next;
prev->next = behind;
delete node;
return;
}
node->data = behind->data;
node->next = behind->next;
delete behind;
}
//删除链表中数据为给定某值的节点
void DeleteNodeWithValue(LinkList head, int value)
{
assert(head->next != NULL);
LinkNode *ahead, *behind;
ahead = head;
behind = ahead->next;
while (behind != NULL && behind->data != value)
{
ahead = behind;
behind = behind->next;
}
if (behind != NULL && behind->data == value)
{
ahead->next = behind->next;
delete behind;
}
}
//获得链表中倒数第K个节点
LinkNode* GetLastKNode(LinkList head, int k)
{
assert(head->next != NULL && k > 1);
LinkNode *ahead, *behind;
ahead = behind = head;
while (k-- > 1 && ahead->next != NULL)
ahead = ahead->next;
if (k!=1 && NULL == ahead->next)
return NULL;
while (ahead->next != NULL)
{
ahead = ahead->next;
behind = behind->next;
}
return behind;
}
//反转链表
LinkList ReverseList(LinkList head)
{
assert(head->next != NULL);
LinkNode *p, *q;
q = head->next;
head->next = NULL;
while (q != NULL)
{
p = q;
q = q->next;
p ->next = head->next;
head->next = p;
}
return head;
}
//合并两个已排序链表
LinkList MergeList(LinkList aHead, LinkList bHead)
{
assert(aHead->next != NULL && bHead->next != NULL);
LinkNode *p, *q, *r, *i;
i = aHead;
r = bHead;
p = i->next;
q = r->next;
while (p!=NULL && q!=NULL) {
if (p->data >= q->data) {
r = q;
q = q->next;
r->next = p;
i->next = r;
}
else {
i = p;
p = p->next;
}
}
if (p == NULL)
i->next = q;
delete bHead;
return aHead;
}