C++ Code
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 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 |
#include <stdio.h>
#include <string.h> #include <ctype.h> #include <stdlib.h> #include <io.h> #include <math.h> #include <time.h> #define OK 1 #define ERROR 0 #define TURE 1 #define FALSE 0 #define MAX_LENGTH_INSERT_SORT 20 /* 用于快速排序时判断是否选用插入排序阙值 */ int visit( int c) { printf( "%d", c); return OK; } typedef struct Node { int data; struct Node *next; }Node; typedef struct Node *LinkList; /************链表初始化***************/ int InitList(LinkList *L) { *L = (LinkList)malloc( sizeof(Node)); if (!(*L)) return ERROR; (*L)->next = NULL; return OK; } /***********判断链表是否为空**********/ int ListEmpty(LinkList L) { if (L->next) return FALSE; else return TURE; } /**********检测链表长度*************/ int ListLength(LinkList L) { int i = 0; LinkList p; p = L->next; while (p) { p = p->next; i++; } return i; } /***********清空链表***************/ int ClearList(LinkList *L) { LinkList p, q; p = (*L)->next; while (p) { q = p->next; free(p); p = q; } (*L)->next = NULL; return OK; } /**********返回L中的第i个值***********/ int GetElem(LinkList L, int i, int *e) { int j; LinkList p; p = L->next; j = 1; while (p && j < i) { p = p->next; j++; } if (!p || j > i) return ERROR; *e = p->data; return OK; } /********在链表的第i个位置插入元素*******/ int ListInsert(LinkList *L, int i, int e) { int j = 1; LinkList p; LinkList s; p = *L; while (p && j < i) { p = p->next; ++j; } if (!p || j > i) return ERROR; s = (LinkList)malloc( sizeof(Node)); s->data = e; s->next = p->next; p->next = s; return OK; } /**********输出链表元素**************/ int ListTraverse(LinkList L) { LinkList p; p = L->next; while (p) { printf( "%d", p->data); p = p->next; } printf( "\n"); return OK; } /*********查询元素e在链表中的位置******/ int LocateElem(LinkList L, int e) { int i = 0; LinkList p = L; p = p->next; while (p) { i++; if (p->data == e) return i; else p = p->next; } return 0; } /**********删除l的第i个元素**************/ int DeleElem(LinkList *L, int i, int *e) { LinkList p; LinkList q; int j = 1; p = (*L)->next; while (p && j < i) { p = p->next; j++; } if (!(p->next) || j > i) return ERROR; *e = p->data; q = p->next; p->next = q->next; free(q); return OK; } /*********表头生成法建立链表**********/ void CreatListHead(LinkList *L, int n) { LinkList p; int i; srand(time( 0)); *L = (LinkList)malloc( sizeof(Node)); (*L)->next = NULL; for (i = 0; i < n; i++) { p = (LinkList)malloc( sizeof(Node)); p->data = rand() % 100 + 1; p->next = (*L)->next; (*L)->next = p; } } /**********表尾生成法创建链表*********/ void CreatListTrail(LinkList *L, int n) { LinkList p, q; int i; srand(time( 0)); *L = (LinkList)malloc( sizeof(Node)); q = *L; for (i = 0; i < n; i++) { p = (LinkList)malloc( sizeof(Node)); p->data = rand() % 100 + 1; q->next = p; q = p; } q->next = NULL; } int main() { LinkList L; int i; int e; int k; int j; i = InitList(&L); printf( "初始化L后:Listlength=%d\n", ListLength(L)); for (j = 1; j <= 5; j++) { i = ListInsert(&L, 1, j); } printf( "在L的表头插入1到5后:L.data="); ListTraverse(L); i = ListEmpty(L); printf( "L是否为空:i= %d(1是,0不是)\n", i); ClearList(&L); printf( "清空L后:ListLength=%d\n", ListLength(L)); i = ListEmpty(L); printf( "L是否为空:i= %d(1是,0不是)\n", i); for (j = 1; j <= 10; j++) { ListInsert(&L, j, j); } printf( "从表尾插入1到10后:L.data="); ListTraverse(L); printf( "ListLength(L) = %d\n", ListLength(L)); ListInsert(&L, 1, 0); printf( "从表头插入0后:L.data="); ListTraverse(L); printf( "表长为:ListLength=%d \n", ListLength(L)); GetElem(L, 5, &e); printf( "第5个元素为:%d \n",e); for (j = 3; j <= 4; j++) { k = LocateElem(L, j); if (k) printf( "第%d个元素的值为%d \n", k, j); else printf( "L中不存在%d元素\n", j); } DeleElem(&L, 5, &e); printf( "删除第5个元素的值为: %d \n", e); printf( "依次输出L的元素"); ListTraverse(L); i = ClearList(&L); printf( "清空L后L的长度为%d \n", ListLength(L)); CreatListHead(&L, 20); printf( "创建L后(头插法)\n"); ListTraverse(L); i = ClearList(&L); printf( "清空L后L的长度为%d \n", ListLength(L)); CreatListTrail(&L, 20); printf( "创建L后(尾插法)\n"); ListTraverse(L); } |