C語言之雙向鏈表
來源：程序員人生 發(fā)布時間：2015-01-05 08:49:55 閱讀次數(shù)：4370次
1，雙向鏈表簡介。
雙向鏈表也叫雙鏈表，是鏈表的1種，它的每一個數(shù)據(jù)結(jié)點中都有兩個指針，分別指向直接后繼和直接先驅(qū)。所以，從雙向鏈表中的任意1個結(jié)點開始，都可以很方便地訪問它的先驅(qū)結(jié)點和后繼結(jié)點。1般我們都構(gòu)造雙向循環(huán)鏈表。
2，例子要求：完成雙向鏈表的插入、刪除和查找，將學生管理系統(tǒng)使用的數(shù)組，以雙向鏈表的方式實現(xiàn)，能夠支持無窮制的學生人數(shù)的增刪改查和保存。
3，代碼實現(xiàn)。#include <stdio.h>#include <string.h>#include <stdarg.h>#include <stdlib.h>typedef struct Student{ char name[20]; int score; char phoneNum[14];} str_student;typedef struct Node{ str_student data; struct Node *prior; //指向先驅(qū)結(jié)點 struct Node *next; //指向后繼結(jié)點}Node, *DLinkList;// 初始化1個學生鏈表DLinkList initDouLinkList(){ Node *L,*p,*r; char name[20]; char phone[14]; int score; L = (Node *)malloc(sizeof(Node)); L->next = NULL; r = L; r->next = NULL; while(1) { p = (Node *)malloc(sizeof(Node)); printf("input name is out exit,input student name:
"); scanf("%s",name); if (strcmp(name,"out")==0) { break; } strcpy(p->data.name, name); printf("input student score:"); scanf("%d",&score); p->data.score = score; printf("input student phone:"); scanf("%s",phone); strcpy(p->data.phoneNum, phone); p->next = r->next; r->next = p; r = p; } r->next = NULL; return L;}//添加學生信息DLinkList insertDouLinkListStuent(DLinkList L,int i,char *name, int score,char *phonenum){ DLinkList p,s; p = L->next; int tempi; for(tempi = 1;tempi < i⑴; tempi++) p = p->next; s = (Node *)malloc(sizeof(Node)); s->data.score = score; strcpy(s->data.name,name); strcpy(s->data.phoneNum,phonenum); s->next = p->next; p->next->prior = s; s->prior = p; p->next = s; return L;}// 查找學生信息int findDouLinkListStudent(DLinkList L,char *name){ DLinkList p; p = L->next; int i = 1; while(p != NULL && (strcmp(p->data.name, name)!=0)) { ++i; p = p->next; } if(p == NULL) return 0; else return i;}// 移除1個學生DLinkList removeDouLinkListStudent(DLinkList L,char *name){ int tempi = 1; DLinkList p; p = L->next; int i =findDouLinkListStudent(L,name); while((tempi++) != i && p != NULL) { p = p->next; } if(p == NULL) printf("no list
"); else if(p->next == NULL) { p->prior->next = NULL; free(p); } else { p->prior->next = p->next; p->next->prior = p->prior; free(p); } return L;}// 鋪助打印信息void printfInfo(DLinkList L){ DLinkList p; p = L->next; while (p!=NULL) { printf("student name %s
",p->data.name); printf("student name %d
",p->data.score); printf("student name %s
",p->data.phoneNum); p=p->next; }}void main (){ char name2[20]="hanmeimei"; char phone2[14]="13612345678"; DLinkList L =initDouLinkList(); // 2.1 初始化學生雙向鏈表數(shù)據(jù) insertDouLinkListStuent(L,1,name2,99,phone2); printfInfo(L); // 2.2 查找學生zhangsan findDouLinkListStudent(L,'zhangsan'); printfInfo(L); // 2.3 刪除學生zhangsan removeDouLinkListStudent(L,'zhangsan'); printfInfo(L); // 2.4 添加學生zengteng insertDouLinkListStuent(L,9,'zengteng',89,'13643345667'); printfInfo(L);}
----------------------------------------------------------------------------------------------------------------
<版權(quán)所有，文章允許轉(zhuǎn)載，但必須以鏈接方式注明源地址，否則追究法律責任!>
原博客地址： http://blog.itpub.net/26230597/viewspace⑴386602/?
原作者：黃杉 (mchdba)
----------------------------------------------------------------------------------------------------------------?
生活不易，碼農(nóng)辛苦
如果您覺得本網(wǎng)站對您的學習有所幫助,可以手機掃描二維碼進行捐贈
------分隔線----------------------------
------分隔線----------------------------
