-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path04-linkedlist-reverse-test.c
168 lines (129 loc) · 3.61 KB
/
04-linkedlist-reverse-test.c
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
#include "stdafx.h"
#include "LinkedList.h"
#include <assert.h>
void testReversePrint() {
int data[] = { 1, 2, 3 };
LinkList head = CreateByHead(data, sizeof(data) / IntSize);
Print(head);
printf("ReversePrint:\n");
ReversePrint(head);
printf("ReversePrint NULL list:\n");
ReversePrint(NULL);
free(head);
}
void testReverse() {
// case 1
int data[] = { 1, 2, 3 };
LinkList head = CreateByHead(data, sizeof(data) / IntSize);
head = Reverse(head);
assert(GetNth(head, 0) == 3);
assert(GetNth(head, 1) == 2);
assert(GetNth(head, 2) == 1);
assert(GetLength(head) == 3);
// case 2
int data2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
head = CreateByHead(data2, sizeof(data2) / IntSize);
head = Reverse(head);
assert(GetNth(head, 0) == 10);
assert(GetNth(head, 1) == 9);
assert(GetNth(head, 2) == 8);
assert(GetLength(head) == sizeof(data2) / IntSize);
// case 3
printf("Reverse NULL list:\n");
head = Reverse(NULL);
assert(head == NULL);
free(head);
}
void testReverseList() {
// case 1
int data[] = { 1, 2, 3 };
LinkList head = CreateByHead(data, sizeof(data) / IntSize);
head = ReverseList(head);
assert(GetNth(head, 0) == 3);
assert(GetNth(head, 1) == 2);
assert(GetNth(head, 2) == 1);
assert(GetLength(head) == 3);
// case 2
int data2[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
head = CreateByHead(data2, sizeof(data2) / IntSize);
head = ReverseList(head);
assert(GetNth(head, 0) == 10);
assert(GetNth(head, 1) == 9);
assert(GetNth(head, 2) == 8);
assert(GetLength(head) == sizeof(data2) / IntSize);
// case 3
printf("Reverse NULL list:\n");
head = ReverseList(NULL);
assert(head == NULL);
free(head);
}
void testSwitchNode() {
// case 1
int data[] = { 1, 2, 3, 4, 5 };
int len = sizeof(data) / IntSize;
LinkList head = CreateByHead(data, len);
head = SwitchNode(head, head);
assert(GetNth(head, 0) == 2);
assert(GetNth(head, 1) == 1);
assert(GetNth(head, 2) == 3);
assert(GetLength(head) == len);
head = SwitchNode(head, head->next->next->next);
assert(GetNth(head, 0) == 2);
assert(GetNth(head, 1) == 1);
assert(GetNth(head, 2) == 3);
assert(GetNth(head, 3) == 5);
assert(GetNth(head, 4) == 4);
assert(GetLength(head) == len);
free(head);
}
void testReverseDoublyList(){
int data[] = { 1, 2, 3 };
Dnode *head = CreateDoublyList(data, sizeof(data) / IntSize);
head = ReverseDoublyList(head);
Dnode *n = GetNthDnode(head,0);
assert(n->data == 3);
assert(n->prev == NULL);
assert(n->next->data == 2);
assert(n->next->prev->data == 3);
assert(n->next->next->data == 1);
assert(GetNthDnode(head,1)->data == 2);
assert(GetNthDnode(head,2)->data == 1);
int data2[] = { 1, 2 };
head = CreateDoublyList(data2, sizeof(data2) / IntSize);
head = ReverseDoublyList(head);
assert(GetNthDnode(head,0)->data == 2);
assert(GetNthDnode(head,1)->data == 1);
int data3[] = { 1 };
head = CreateDoublyList(data3, sizeof(data3) / IntSize);
head = ReverseDoublyList(head);
assert(GetNthDnode(head,0)->data == 1);
free(head);
}
void testSwapPairs(){
// case 1
int data[] = { 1, 2, 3, 4, 5 };
LinkList head = CreateByHead(data, sizeof(data) / IntSize);
head = SwapPairs(head);
assert(GetNth(head,0)==2);
assert(GetNth(head,1)==1);
assert(GetNth(head,2)==4);
assert(GetNth(head,3)==3);
assert(GetNth(head,4)==5);
assert(GetLength(head)==5);
// case 2
int data2[] = { 1 };
head = CreateByHead(data, sizeof(data2) / IntSize);
head = SwapPairs(head);
assert(GetNth(head,0)==1);
assert(GetLength(head)==1);
free(head);
}
//
void TestReverse() {
testReversePrint();
testReverse();
testReverseList();
testSwitchNode();
testReverseDoublyList();
testSwapPairs();
}