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
| #include "Linklist.h" void testPushBack() { pList plist; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); PopBack(&plist); PopBack(&plist); PopBack(&plist); PopBack(&plist); PrintList(plist); DestroyLinkList(&plist); } void testPushfront() { pList plist; InitLinkList(&plist); PushFront(&plist, 1); PushFront(&plist, 2); PushFront(&plist, 3); PushFront(&plist, 4); PopFront(&plist); PopFront(&plist); PopFront(&plist); PopFront(&plist); PrintList(plist); DestroyLinkList(&plist); } void testInsert() { pNode pos = NULL; pList plist; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); pos = Find(plist, 4); if (pos != NULL) { Insert(&plist, pos, 5); } PrintList(plist); DestroyLinkList(&plist); } void testErase() { pNode pos = NULL; pList plist; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); pos = Find(plist, 2); if (pos != NULL) { Erase(&plist, pos); } PrintList(plist); DestroyLinkList(&plist); } void testRemove() { int length = 0; pList plist; InitLinkList(&plist); PushBack(&plist, 2); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); PushBack(&plist, 2); RemoveAll(&plist, 2); length = GetListLength(plist); printf("单链表长度为:%d\n", length); PrintList(plist); DestroyLinkList(&plist); } void testEraseNotTailNode() { pList plist; pNode newNode = NULL; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); PushBack(&plist, 5); newNode = Find(plist, 3); EraseNotTailNode(newNode); PrintList(plist); DestroyLinkList(&plist); } void testPrintTailToHeadRec() { pList plist; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); PushBack(&plist, 5); PrintTailToHeadRec(plist); } void testPrintTailToHead() { pList plist; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); PushBack(&plist, 5); PrintTailToHead(plist); } void testInsertNotTailNode() { pList plist; pNode newNode = NULL; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); PushBack(&plist, 5); newNode = Find(plist, 3); InsertNotTailNode(newNode, 6); PrintList(plist); DestroyLinkList(&plist); } void testJosephCircle() { pList plist; pNode head = NULL; pNode tail = NULL; pNode newNode = NULL; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); head = plist; tail = plist; while (tail->next && tail) { tail = tail->next; } tail->next = head; newNode = JosephCircle(&plist, 3); printf("剩余的数字为:%d\n", newNode->data); free(plist); plist = NULL; } void testTailToHeadListWayOne() { pList plist; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); PushBack(&plist, 5); TailToHeadListWayOne(&plist); PrintList(plist); DestroyLinkList(&plist); } void testTailToHeadListWayTwo() { pList plist; InitLinkList(&plist); PushBack(&plist, 1); PushBack(&plist, 2); PushBack(&plist, 3); PushBack(&plist, 4); PushBack(&plist, 5); TailToHeadListWayTwo(&plist); PrintList(plist); DestroyLinkList(&plist); } int main() {
system("pause"); return 0;
|