01---链表.c (19级电科一班刘子琦、陈辉、徐超杰，李新玖共同制作)

?

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 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476

#include<stdio.h> #include<stdlib.h> #include<malloc.h>    //定义节点结构体 typedef struct _node{     int value;                //定义链表一个节点的数据域     struct _node *next;       //定义链表一个节点的指针域 }Node,Date;                   //两个链表的名字   //函数声明 void ShowMenu(); Node *choosen(); Date *choosed(); Node *nadd(); Node *nsort(Node *phead); Node *nprint(Node *phead); Node *ndelet1(Node *phead); Node *ninsert(Node *phead); Node *ndelet0(Node *phead); Date *dadd(); Date *dsort(Date *phead); Date *dprint(Date *phead); Date *ddelet1(Date *phead); Date *dinsert(Date *phead); Date *ddelet0(Date *phead); Node *ndconnect(Node *pnhead,Date *pdhead);    int main() {     printf("***********************************************\n");     printf("19级电科一班刘子琦、陈辉、徐超杰，李新玖共同制作\n");     printf("***********************************************\n");     ShowMenu();               //调用函数     return 0; }   void ShowMenu()               //菜单 {     Node *nhead,*ndhead,*p;     Date *dhead;     char i;     printf("选择链表，输入‘n’或者‘d’\n输入‘L’为两个链表连接并输出（警告：需要先创建链表）\n输入‘H’退出：");     while( i != 'H' )     {         scanf("%c",&i);         switch(i)                                      //调用函数         {             case('n'):nhead = choosen();break;             case('d'):dhead = choosed();break;             case('L'):ndhead = ndconnect(nhead,dhead);                         for( p=ndhead ; p ; p=p->next )       //遍历链表并输出                                      {                                 printf("%d\n", p->value );                                                    }                         printf("\n"); break;             case('H'):break;         }     } }   Node *choosen() {         Node *head,*phead;      char i;     printf("输入I为输入数据。\n输入R为链表排序。\n输入O为输出数据。\n输入S为查找和删除数据。\n输入E为插入数据。\n输入D为删除链表。\n输入G为退出\n");     while(i != 'G')     {         scanf("%c",&i);         switch(i)                               //调用函数         {             case('I'):head = phead = nadd();break;             case('R'):head = nsort(phead);break;             case('O'):head = nprint(phead);break;             case('S'):head = ndelet1(phead);break;             case('E'):head = ninsert(phead);break;             case('D'):head = ndelet0(phead);break;             case('G'):printf("已退出。\n");break;         }     }     return phead; }   Date *choosed() {     Date *head,*phead;     char i;     printf("输入I为输入数据。\n输入R为链表排序。\n输入O为输出数据。\n输入S为查找和删除数据。\n输入E为插入数据。\n输入D为删除链表。\n输入G为退出\n");     while(i != 'G')     {         scanf("%c",&i);         switch(i)                                        //调用函数         {             case('I'):head = phead = dadd();break;             case('R'):head = dsort(phead);break;             case('O'):head = dprint(phead);break;             case('S'):head = ddelet1(phead);break;             case('E'):head = dinsert(phead);break;             case('D'):head = ddelet0(phead);break;             case('G'):printf("已退出。\n");break;         }     }     return phead; }   Node *nadd() {     int number;     Node *phead = NULL;                                  //初始化     do{         printf("输入数据,输入-1结束：");                 //输入数据         scanf("%d",&number);         if(number != -1)         {             Node *p=(Node*)malloc(sizeof(Node));         //申请内存空间             p -> value = number;                         //将刚输入的数据存入新建节点的数据域中             p -> next = NULL;                            //新建节点指针域初始化             Node *last = phead;                          //定义并初始化指向下一个节点的指针             if(last)                                     //判断该指针是否为空             {                 while(last -> next)                      //判断该指针指向的节点的指针域是否为空                 {                     last = last -> next;              //使该指针指向下一个节点                 }                 last -> next = p;                        //将指针p的值赋给last指针             }else             {                 phead = p;                               //使头指针指向第一个节点             }         }     }while(number != -1);                                //判断输入的数据是否为-1     return phead; }   Node *nsort( Node *phead ) {     Node *p,*tail,*q;                                    //定义结点指针     p = q = tail = NULL;                                 //初始化     if(phead == NULL || phead->next == NULL)              //排除空链表和单节链表     {         printf("无需排序。\n");         return;     }     while(phead != tail)                                 //外循环     {         int Ischange = 0;                                //定义判断变量         p = phead;                                       //使p指针指向头节点         q = p->next;                                     //使q指针指向第二节节点         while(q != tail)                                 //内循环         {             if(p->value > q->value)                      //比较             {                 int number = q->value;                   //将两个节点调换                 q->value = p->value;                 p->value = number;                 Ischange = 1;             }             p = p->next;                                 //向后移动             q = q->next;                                 //向后移动         }         if(!Ischange)         {             printf("排序完成！\n");             return;         }         tail = p;                                        //尾节点指针向前移动     }     printf("排序完成！\n");                               //提示     return phead; }   Node *nprint( Node *phead ) {     Node *p = NULL;                                      //定义结点指针并初始化     for( p=phead ; p ; p=p->next )                        //循环遍历链表     {         printf("%d\n", p->value );                             }     printf("\n");     return phead; }   Node *ndelet1( Node *phead ) {     int number,sam;     printf("输入要查找的值：");     scanf("%d", &number );     int isFound = 0;                                    //定义判断变量     Node *p,*q;                                         //定义结点指针     for( q=NULL , p=phead ; p ; q=p , p=p->next)     {         if(p->value == number)                          //判断是否符合要找的数据         {             printf("找到了。\n");                       //遍历链表查找             isFound = 1;             break;         }     }     if( !isFound )     {         printf("没找到。\n");     }     if( isFound == 1 )     {         printf("是否删除？删除输入1，否则输入0.\n");         scanf("%d",&sam);         switch(sam)         {             case(1):for( q=NULL , p=phead ; p ; q=p , p=p->next)                     {                         if(p->value == number)                         {                             if( q )                             {                                 q->next = p->next;                    //删除一个节点并连接剩下的节点                             }else{                                 phead = p->next;                             }                             free(p);                             printf("删除完成！\n");                             break;                         }                     }                     break;             case(0):break;             default:printf("无效！\n");         }     }     return phead;  }   Node *ninsert( Node *phead )                                //插入节点函数 {     int number,a;     printf("输入要插入的值：");     scanf("%d",&number);     Node *p=(Node*)malloc(sizeof(Node));                   //申请新节点空间     p->value = number;                                     //将输入的数据存入新节点数据域     p->next = NULL;                                        //初始化新节点指针域     Node *q,*i;                                            //定义结点指针     printf("输入想要插入的到节点后面的节点的值：");     scanf("%d",&a);     for( q=NULL , i=phead ; i ; q=i , i=i->next)            //遍历链表查找     {         if(i->value == a)         {             p->next = i->next;                             //将新节点指针域存入下一个节点指针值             i->next = p;                                   //将找到的节点的指针域存入新节点指针值             break;         }     }     printf("插入完成！\n");     return phead; }   Node *ndelet0( Node *phead ) {     Node *q,*p;                                             //定义结点指针     for( p = phead ; p ; p=q )                              //遍历链表     {         q = p -> next;                                       //全部删除         free(p);     }     printf("删除完成！\n");     return phead; }   Date *dadd()                                 {     int number;     Date *phead = NULL;                                     //初始化     do{         printf("输入数据,输入-1结束：");                   //输入数据         scanf("%d",&number);         if(number != -1)         {             Date *p=(Date*)malloc(sizeof(Date));           //申请内存空间             p -> value = number;                           //将刚输入的数据存入新建节点的数据域中             p -> next = NULL;                              //新建节点指针域初始化             Date *last = phead;                            //定义并初始化指向下一个节点的指针             if(last)                                       //判断该指针是否为空             {                 while(last -> next)                        //判断该指针指向的节点的指针域是否为空                 {                     last = last -> next;                //使该指针指向下一个节点                     }                 last -> next = p;                          //将指针p的值赋给last指针             }else             {                 phead = p;                                 //使头指针指向第一个节点             }         }     }while(number != -1);                                  //判断输入的数据是否为-1     return phead; }   Date *dsort( Date *phead ) {     Date *p,*tail,*q;                                      //定义结点指针     p = q = tail = NULL;                                   //初始化     if(phead == NULL || phead->next == NULL)                //排除空链表和单节链表     {         printf("无需排序。\n");         return;     }     while(phead != tail)                                   //外循环     {         int Ischange = 0;                                  //定义判断变量         p = phead;                                         //使p指针指向头节点         q = p->next;                                    //使q指针指向第二个节点         while(q != tail)                                   //内循环         {             if(p->value > q->value)                           //比较             {                 int number = q->value;                      //将两个节点调换                 q->value = p->value;                 p->value = number;                 Ischange = 1;             }             p = p->next;                                //向后移动             q = q->next;                                //向后移动         }         if(!Ischange)         {             printf("排序完成！\n");             return;         }         tail = p;                                          //尾结点指针向前移动     }     printf("排序完成！\n");                                 //提示     return phead; }   Date *dprint( Date *phead ) {     Date *p = NULL;                                        //定义结点指针并初始化     for( p=phead ; p ; p=p->next )                          //循环遍历链表     {         printf("%d\n", p->value );                    }     printf("\n");     return phead; }   Date *ddelet1( Date *phead ) {     int number,sam;     printf("输入要查找的值：");     scanf("%d", &number );     int isFound = 0;                                      //定义判断变量     Date *p,*q;                                           //定义结点指针     for( q=NULL , p=phead ; p ; q=p , p=p->next)     {         if(p->value == number)                            //判断是否符合要找的数据         {             printf("找到了。\n");                         //遍历链表查找                          isFound = 1;             break;         }     }     if( !isFound )     {         printf("没找到。\n");     }     if( isFound == 1 )     {         printf("是否删除？删除输入1，否则输入0.\n");         scanf("%d",&sam);         switch(sam)         {             case(1):for( q=NULL , p=phead ; p ; q=p , p=p->next)                     {                         if(p->value == number)                         {                             if( q )                             {                                 q->next = p->next;       //删除一个节点并连接剩下的节点                                          }else{                                 phead = p->next;                             }                             free(p);                             printf("删除完成！\n");                             break;                         }                     }                     break;             case(0):break;             default:printf("无效！\n");         }     }     return phead; }   Date *dinsert( Date *phead )                         //插入节点函数 {     int number,a;     printf("输入要插入的值：");     scanf("%d",&number);     Date *p=(Date*)malloc(sizeof(Date));                //申请新节点空间     p->value = number;                                  //将输入的数据存入新节点数据域     p->next = NULL;                                     //初始化新节点指针域     Date *q,*i;                                         //定义结点指针      printf("输入想要插入的到节点后面的节点的值：");     scanf("%d",&a);     for( q=NULL , i=phead ; i ; q=i , i=i->next)         //遍历链表查找     {         if(i->value == a)         {             p->next = i->next;                          //将新节点指针域存入下一个节点指针值             i->next = p;                                //将找到的节点的指针域存入新节点指针值             break;         }     }     printf("插入完成！\n");     return phead; }   Date *ddelet0( Date *phead ) {     Date *q,*p;                                         //定义结点指针     for( p = phead ; p ; p=q )                          //遍历链表     {         q = p -> next;                                   //全部删除         free(p);     }     printf("删除完成！\n");     return phead; }   Node *ndconnect( Node *pnhead,Date *pdhead )             //链表连接函数                     {     Node *p,*tail,*q;                                    //定义结点指针     if(pnhead == NULL)                                   //排除链表为空情况     {         return pdhead;                                   //返回头节点     }     if(pdhead == NULL)                                   //排除链表为空情况     {         return pnhead;                                   //返回头节点     }     p = pnhead;                                          //读取头节点     while( p->next )                                  //循环找到尾节点     {         p = p->next;     }                  p->next = pdhead;                                    //连接                                        p = q = tail = NULL;                                 //初始化     if(pnhead == NULL || pnhead->next == NULL)            //排除空链表和单节链表     {         return pnhead;                                   //返回头节点     }     while(pnhead != tail)                                //外循环     {         int Ischange = 0;                                //定义判断变量         p = pnhead;                                      //使p指针指向头节点         q = p->next;                                     //使q指针指向第二节节点         while(q != tail)                                 //内循环         {             if(p->value > q->value)                      //比较             {                 int number = q->value;                   //将两个节点调换                 q->value = p->value;                 p->value = number;                 Ischange = 1;             }             p = p->next;                                 //向后移动             q = q->next;                                 //向后移动         }         if(!Ischange)         {             return pnhead;                               //返回头节点         }         tail = p;                                        //尾节点指针向前移动     }     return pnhead;                                       //返回头节点                              }