kk.rar_visual c

#include<stdio.h> #include<malloc.h> #include<fstream.h> #define maxsize 100 struct list { int data; list *prior; list *next; }; list* creat(int sum) { /***********存数据************/ FILE *fp1; fp1=fopen("shuju.txt","wt"); int num[maxsize]; for(int i=0;i<sum;i++) { scanf("%d",&num[i]); fputc((char)num[i],fp1); fputc(' ',fp1); } printf("数据已存入文档！\n"); fclose(fp1); /***********读数据*************/ list *a,*m,*d; FILE *fp2; fp2=fopen("shuju.txt","r"); m=(list*)malloc(sizeof(list)); a=m; int x; char ch; while((ch=fgetc(fp2))!=EOF) { if(ch!=' ') { x=ch; m->data=x; d=(list*)malloc(sizeof(list)); d->prior=m; m->next=d; m=d; } } m=m->prior; m->next=NULL; delete d; fclose(fp1); return a; } list* add(list *a,list *b) { list *c,*l,*r; l=(list*)malloc(sizeof(list)); l->prior=NULL; l->next=NULL; c=l; while(a!=NULL&&b!=NULL) { if(a->data<b->data) { l->data=a->data; a=a->next; } else if(a->data>b->data) { l->data=b->data; b=b->next; } else { l->data=a->data; b=b->next; a=a->next; } /********将l指向下一个位置********/ r=(list*)malloc(sizeof(list)); r->prior=l; l->next=r; l=r; } if(b!=NULL) { l=l->prior; delete r; l->next=b; b->prior=l; } else { l=l->prior; delete r; l->next=a; a->prior=l; } return c; } void display(list *p) { while(p!=NULL) { printf("%d\n",p->data); p=p->next; } } void main() { list *a,*b,*p; printf("请输入第一个链表的数据个数：\n"); int i; scanf("%d",&i); printf("请升序输入第一个链表的数值,数据不能超过127！\n"); a=creat(i); printf("请输入第二个链表的数据个数：\n"); int j; scanf("%d",&j); printf("请升序输入第二个链表的数值,数据不能超过127！\n"); b=creat(j); printf("新表如下：\n"); p=add(a,b); display(p); }