软件技术基础参考程序.doc

软件技术基础参考程序（1） 顺序表操作#define MAXNUM 10#define TRUE 1#define FALSE 0struct listtype int dataMAXNUM; /*假定线性表中的数据元素类型是整型*/ int num; ;typedef struct listtype LIST;LIST list;int insertl(LIST *l,int i,int x) int j; if (l-num=MAXNUM) printf(the list is full); return(FALSE); if(il-num) printf(i is invalid value); return(FALSE); for(j=l-num-1;j=i;j-) l-dataj+1=l-dataj; l-datai=x; l-num+; return(TRUE);int delete(LIST *l,int i) int j; if(l-num0) printf(list is empty); return(false);if(il-num-1) printf(i is invalid value); return(false);for(j=i;jnum-1;j+) l-dataj=l-dataj+1; l-num-; return(true);main( ) int i,x; scanf(“input length of list:%d“，&list.num); for (i=0;ilist.num;i+) scanf(%d,&list.datai);/*从键盘输入 num个数到数组data中,建立顺序表*/ scanf(“%d”,&x); /*输入待插入的数据元素给变量x*/ scanf(“input place of insert data:%d”,&i); insertl(&list,i,x);for(i=0;ilist.num;i+)printf(%d,list.datai); scanf(“input place of delete data:%d”&i);delete(&list,i); for(i=0;ilist.num;i+) printf(%d,list.datai);（2） 链表操作#define NULL 0struct node int data; struct node *next; /*假定要处理的线性表是整数的集合*/;typedef struct node node;void create(node *h,int len) int x; node *p,*s; for(i=0;idata=x; if(h-next=NULL)h-next=s; else p-next=s; p=s; p-next=NULL;int access (node *h,int i) node *p; int j; p=h;j=0; while(p-next!=NULL&jnext;j+; if(p!=NULL&j=i) return(p-data); else return(NULL);insert (node *h,int i) node *p,*t; int x; int j=0; p=h; while(p!=NULL&jnext; j+; if(j!=i-1) printf(i is invalid); return; t=(node *)malloc(sizeof(node); scanf(“insert data :%d,&x); t-data=x; t-next=p-next;p-next=t; main( ) node *h; int x,i,len,p,ip,dp; h=(node *)malloc(sizeof(node); h-next=NULL; scanf(“please input length of linked list :%d”,&len); create(h,len);scanf(“input place of access data:%d”,&p) x=access (h,p); printf(“access data:%dn,x);scanf(“ input place of insert data%d”,&ip) insert(h,ip); for(i=1;itop=-1;pushs(stacktype *s,int x) if(s-top=MAXNUM-1) return(false); else s-top+; s-stacks-top=x; return(true); int pops(stacktype *s) if(s-toptop-; return(s-stacks-top+1); main( ) stacktype stack; int i,x,y; initiatest(&stack); for(i=1;i=5;i+) scanf(%d,&x); pushs(&stack,x); for(i=0;i5;i+) printf(%d,stack.stacki);for(i=1;idata=x; p-next=top; top=p; int pops() NODE *p; int x; if(top=NULL) printf(stack is underflow); return(NULL); else x=top-data; p=top; top=top-next; free(p); return(x); main( ) int n,i,x; NODE *p; scanf(%d,&n); top=NULL; for(i=1;idata=x; p-next=top; top=p; for(i=1;idata; printf(%d,x); top=top-next; top=p; x=top-data; scanf(%d,&x); pushs(x);for(i=1;irear=MAXNUM) return(false); else q-rear+; q-queueq-rear=x; return(true); int delete(queuetype *q) if(q-front=q-rear) return(false); else q-front+; return(q-queueq-front); main( ) queuetype queu; int i,x,n; queu.front=0; queu.rear=0; scanf(“input length of queue:%d”,&n); for(i=1;i=n;i+) scanf(input queue data:%d,&x); enter(&queu,x); for(i=1;idata=x; p-next=NULL; q-rear-next=p; q-rear=p;int delete(queue *q) NODE *p; int x; if(q-front-next=NULL) return(NULL); else p=q-front-next; x=p-data; q-front-next=p-next; if(p-next=NULL) q-rear=q-front; free(p); return(x); main( ) queue qu; NODE *p; int i,n,x; p=(NODE *)malloc(sizeof(NODE); p-next=NULL; qu.front=p; qu.rear=p; scanf(input queue data:%d,&n); for(i=1;i=n;i+) scanf(%d,&x); enter(&qu,x); for(i=1;i=3;i+) x=delete(&qu); printf(%d,x); 第九题：#define TRUE 1#define MAXNUM 10 struct list int aMAXNUM+1; int elenum;typedef struct list listtype;main( ) listtype list; int i,x; scanf(input length of list:%d,&list.elenum); for(i=0;ilist.elenum;i+) scanf(input data:%d,&list.ai);/