Sjjg线性表.ppt

创建链表 void create(HList *h) { int i,j; DList *r,*s; h=(HList *)malloc(sizeof(HList)); //创建表头结点 h-next = NULL; printf(“输入表的行数与列数：”); scanf(“%d%d”,h-Row,h-Col); for (i=0;ih-Row,i++) { printf(“第%d行：”,i+1); s=(DList *)malloc(sizeof(DList)); //创建数据结点 for (j=0,jh-Col;j++) scanf(“%d”,s-data[j]); if (h-next == NULL) h-next = s; //插入第一个结点 else r-next = s; //插入其他结点 r=s; } r-next=NULL; //表尾结点的next域置空 } A = 1 2 3 2 3 4 1 1 1 #define MaxCol 10 typedef struct Nodel { ElemType data[MaxCol]; struct Nodel *next; }DList; typedef struct Node2 { int Row,Col; Dlist *next; }HList 创建链表 void create(HList *h) { int i,j; DList *r,*s; h=(HList *)malloc(sizeof(HList)); //创建表头结点 h-next = NULL; printf(“输入表的行数与列数：”); scanf(“%d%d”,h-Row,h-Col); for (i=0;ih-Row,i++) { printf(“第%d行：”,i+1); s=(DList *)malloc(sizeof(DList)); //创建数据结点 for (j=0,jh-Col;j++) scanf(“%d”,s-data[j]); if (h-next == NULL) h-next = s; //插入第一个结点 else r-next = s; //插入其他结点 r=s; } r-next=NULL; //表尾结点的next域置空 } A = 1 2 3 2 3 4 1 1 1 ∧ 3 3 h 循环3次创建3个数据结点 1 2 3 … s r 2 3 4 … s r 输出链表 void display(HList *h) { int j; DList *p=h-next; while (p!=NULL) { for (j=0,jh-Col;j++) printf(“%4d”,p-data[j]); printf(“\n”); p=p-next; } } ∴ C = A B 3=1 = 1 2 3 3 5 1 2 3 3 4 1 1 1 1 6 自然连接 A = 1 2 3 2 3 4 1 1 1 B = 3 5 1 6 3 4 void link(HList *h1,HList *h2,HList *h) { int f1,f2,i; DList *p=h1-next,*q,*s,*r; printf(“连接条件：第1表第几列、第2表第几列”); scanf(“%d%d”,f1,f2); h=(HList *)malloc(sizeof(HList)); h-Row=0, h-Col=h1-Col + h2-Col; h-next=NULL; while (p!=NULL) { q=h2-next; while (q!=NULL) { if p-data[f1-1] == q-data[f2-1]) { s=(DList *)malloc(sizeof(DList)); for (i=0,ih1-Col;i++) s-data[i]=p-data[i]; for (i=0,ih2-Col;i++) s-data[h1