数据结构 上级程序一(C语言).doc

程序一：顺序表的运算#define MAX 100#include "stdio.h"int n;int insert(int b,int x,int i) int j; if(n>=MAX) return(0); if(i<1|i>n+1) return(0); else for(j=n;j>=i;j-) bj=bj-1; bj=x; n+; return(1); int delete(int b,int i) int j; if(n=0) return(0); if(i<1|i>n) return(0); else for(j=i;j<n;j+) bj-1=bj; n-; return(1); void quit() exit(0);void print(int b) int j; printf("n"); for(j=0;j<n;j+) printf("%4d",bj); printf("n");main() int aMAX=10,34,81,25,97,50; int x,i,sel,result; printf("nn"); n=6; while(1) printf("1. insertn"); printf("2. deleten"); printf("3. exitn"); printf("*n"); printf("Please select(1-3): "); scanf("%d",&sel); switch(sel) case 1: printf("Please input the inserted number: "); scanf("%d",&x); printf("Please input the insert-location: "); scanf("%d",&i); result=insert(a,x,i); if(result=1) printf("nThe result after insert:n"); print(a); break; case 2: printf("Please input the index of delete: "); scanf("%d",&i); result=delete(a,i); if(result=1) printf("nThe result after delete:n"); print(a); break; case 3: quit(); break; default: printf("nINPUT SELECT ERROR! PlEASE RETRY!nn"); 程序二：单链表的运算#include "stdio.h"#include "stdlib.h"struct link int data; struct link *next;typedef struct link NODE;NODE *rcreat() NODE *p,*r,*s; int i; s=(NODE*)malloc(sizeof(NODE); p=s; r=s; s->next=NULL; printf("nnPlease input data: "); scanf("%d",&i); while(i) s=(NODE*)malloc(sizeof(NODE); s->data=i; r->next=s; r=s; printf("nPlease input data: "); scanf("%d",&i); r->next=NULL; return(p);void print(NODE *head) NODE *p; p=head->next; while(p) printf("%5d",p->data); p=p->next; void insert(NODE *head,int x,int i) NODE *p,*s; int count=0; p=head; while(count<i-1) p=p->next; count+; s=(NODE*)malloc(sizeof(NODE); s->data=x; s->next=p->next; p->next=s;int delete(NODE *head,int i) NODE *p=head,*q; int count=0; int del_data; if(head->next=NULL) return(0); else while(count<i-1) p=p->next; count+; q=p->next; p=q->next; del_data=q->data; free(q); return(del_data); main() NODE *head; int c,x,i,d; head=rcreat(); printf("nScaning result:n"); print(head); while(1) printf("n*"); printf("n1. insertn2. deleten3. exit"); printf("n*"); printf("nPlease select(1-3): "); scanf("%d",&c); if(c=1) printf("nPlease input new data: "); scanf("%d",&x); printf("Please input insert location: "); scanf("%d",&i); insert(head,x,i); printf("*"); printf("nThe result after insert is:n"); print(head); else if(c=2) printf("nPlease input delete location: "); scanf("%d",&i); d=delete(head,i); printf("*"); printf("nThe result after delete is:n"); print(head); printf("nThe deleted data is: %dn",d); else if(c=3) exit(0); else printf("n*Input error! Please retry!*n"); 程序三：两个栈共享空间#define M 100typedef struct stack int elemM; int top2;DQSTACK;void init(DQSTACK *s) s->top0=-1; s->top1=M;int push(DQSTACK *s,int x,int i) if(s->top0+1=s->top1) return(0); else if(i=1) s->top0+; s->elems->top0=x; if(i=2) s->top1-; s->elems->top1=x; return(1); int pop(DQSTACK *s,int *x,int i) if(i=1 && s->top0=-1) return(0); if(i=1) *x=s->elems->top0; (s->top0)-; return(1); if(i=2 && s->top1=M) return(0); if(i=2) *x=s->elems->top1; (s->top1)+; return(1); void gettop(DQSTACK *s,int i) if(i=1) if(s->top0=-1) printf("nStack 1 is empty!n"); return; else printf("nTop element of stack 1 is %dnLocation is %dn",s->elems->top0,s->top0); if(i=2) if(s->top1=M) printf("nStack 2 is empty!n"); return; else printf("nTop element of stack 2 is %dnLocation is %dn",s->elems->top1,s->top1);main() DQSTACK *s; int k,m,insx,*delx,insult; init(s); while(1) printf("nPlease select:n1. PUSHn2. POPn3. PRINTn4. EXITn-"); scanf("%d",&k); if(k=4) return; else printf("Please input the index of stack( 1 or 2 ): "); scanf("%d",&m); if(k=1) printf("Please input the value of the pushed element: "); scanf("%d",&insx); insult=push(s,insx,m); if(insult=0) printf("Stack is FULL!n"); else printf("Push success!n"); if(k=2) insult=pop(s,delx,m); if(insult=0) printf("Stack is EMPTY!n"); else printf("Pop success! The deleted element is %dn",*delx); if(k=3) gettop(s,m); 程序四：循环队列的入队和出队#include "stdio.h"#define MAXSIZE 50typedef struct int dataMAXSIZE; int front; int rear;SEQQUEUE;void enqueue(SEQQUEUE *q,int x) if(q->rear+1)%MAXSIZE=q->front) printf("Queue Overflow!n"); else q->rear=(q->rear+1)%MAXSIZE; q->dataq->rear=x; int delqueue(SEQQUEUE *q) int x; if(q->front=q->rear) printf("Queue Underflow!n"); else q->front=(q->front+1)%MAXSIZE; x=q->dataq->front; return(x); void iniqueue(SEQQUEUE *q) q->front=q->rear=-1;void output(SEQQUEUE *q) int i; if(q->front!=q->rear) printf("n*n"); printf("Present queue element: "); for(i=q->front+1;i<=q->rear;i=(i+1)%MAXSIZE) printf("%4d",q->datai); printf("n*n"); main() SEQQUEUE *q; int sel,ins_x,del_x; clrscr(); iniqueue(q); while(1) printf("Please select :n"); printf(" 1. ENQUEUE(insert queue)n"); printf(" 2. DELQUEUE(delete queue)n"); printf(" 3. PRINTn"); printf(" 4. EXITn"); printf("*Please input number(1-4): "); scanf("%d",&sel); if(sel=1) printf("nInput x: "); scanf("%d",&ins_x); enqueue(q,ins_x); else if(sel=2) del_x=delqueue(q); printf("*nThe deleted value is %dn*n",del_x); else if(sel=3) output(q); else if(sel=4) exit(0); else printf("*Invaid selection!*n");