软件实验文档

1.顺序表的逆置（1）程序为：#include<stdio.h>#include<malloc.h>typedef char datatype;const int maxsize=1024;typedef struct{ datatype data[maxsize];int last;}sequenlist;void create(sequenlist*&);void print(sequenlist*);void invert(sequenlist*);void main(){ sequenlist*L;create(L);print(L);invert(L);print(L);}void create(sequenlist*&L){L=(sequenlist*)malloc(sizeof(sequenlist));L->last=0;char ch;while((ch=getchar())!='*'){L->last++;L->data[L->last]=ch;}}void print(sequenlist*L){for(int i=1;i<=L->last;i++)printf("%2c",L->data[i]);printf("\n");}void invert(sequenlist*L){int i=1;datatype temp;while(i<=L->last/2){temp=L->data[i];L->data[i]=L->data[L->last-i+1];L->data[L->last-i+1]=temp;i++;}}#include<malloc.h>#include<stdio.h>typedef char datatype;typedef struct node{datatype data;struct node *next;}linklist;void create(linklist*&);void print(linklist *);void invert(linklist*);void main(){linklist*head;create(head);print(head);invert(head);print(head);}void create(linklist*&head){char ch;linklist *s,*r;head=(linklist*)malloc(sizeof(linklist));r=head;while((ch=getchar())!='*'){s=(linklist*)malloc(sizeof(linklist));s->data=ch;r->next=s;r=s;}r->next=NULL;}void print(linklist*head){linklist*p=head->next;while(p!=NULL){printf("%2c",p->data);p=p->next;}printf("\n");}void invert (linklist*head){ linklist*p,*q,*r;p=head->next;q=p->next;while(q!=NULL){ r=q->next;q->next=p;p=q;q=r; }head->next->next=NULL;head->next=p;}判断字符串是否中心对称程序为#include<stdio.h>#include<malloc.h>#include<string.h>typedef char datatype;typedef struct node{ datatype data;struct node *next;}linklist;const int maxsize=40;typedef struct{ datatype elements[maxsize];int top;}stack;void setnull(stack *&);int length(linklist*);void printlink(linklist*);void create(linklist *&,datatype*);void push(stack*,datatype);datatype pop(stack*);int symmetry(linklist*,stack*);//ÅÐ×Ö·û´®ÊÇ·ñÖÐÐĶԳƵĺ¯ÊýÉùÃ÷int main(){linklist *head;stack *s;datatype str[80];gets(str);create(head,str);printlink(head);setnull(s);if(symmetry(head,s)) printf("中心对称\n",str);else printf("不是中心对称\n",str);system("pause");return 0;}void setnull(stack *&s){s=(stack*)malloc(sizeof(stack));s->top=-1;}int length(linklist*head){ linklist *p=head->next;int n=0;while(p!=NULL){ n++; p=p->next; }return n;}void printlink(linklist*head){ linklist *p=head->next;while(p!=NULL){ printf("%c",p->data);p=p->next;}printf("\n");}void create(linklist *&head,datatype*str){ datatype *p=str;linklist *s,*r;head=(linklist*)malloc(sizeof(linklist));r=head;while(*p!='\0'){s=(linklist*)malloc(sizeof(linklist));s->data=*p;r->next=s;r=s;p++;}r->next=NULL;}void push(stack*s,datatype e){s->top++;s->elements[s->top]=e;}datatype pop(stack*s){datatype temp;s->top--;temp=s->elements[s->top+1];return temp;}int symmetry(linklist*head,stack*s) {int len,len1,len2,i,a;len=length(head);if(len%2==0){len1=len/2;}else{len1=(len-1)/2;}for(i=1;i<=len1+1;i++){push(s,head->data);head=head->next;}if(len%2==1){head=head->next;}for(i=1;i<=len1;i++){a=pop(s);if(a!=head->data){head=head->next;return 0;break;}elsehead=head->next;if(i==len1+1)return 1;}}//循环队列入队出队#include<stdio.h>#include<stdlib.h>#include<malloc.h>//循环队列的结构类型定义const int m=5;typedef int datatype;typedef struct{ datatype sequ[m];int rear, quelen;}qu;void setnull(qu*);void enqueue(qu*, datatype);datatype *dequeue(qu*);void main(){ qu *sq;datatype x, *p;int key;sq=(qu*)malloc(sizeof(qu));setnull(sq);do{ printf("1.Enter Queue 2.Delete Queue -1.Quit:");scanf("%d",&key);switch(key){ case 1: printf("Enter the Data:"); scanf("%d",&x);enqueue(sq,x); break;case 2: p=dequeue(sq);if(p!=NULL) printf("%d\n",*p);break;case -1: exit(0);}}while(1);}//置空队void setnull(qu *sq){ sq->rear=m-1;sq->quelen=0;}//添加入队算法void enqueue( qu * sq,datatype x){if(sq->quelen==m){printf("队满，入队失败.\n");return;}sq->rear=(sq->rear+1)%m;sq->sequ[sq->rear]=x;sq->quelen++;return;}//添加出队算法datatype* dequeue(qu* sq){datatype *x;x=(datatype*)malloc(sizeof(datatype));if(sq->quelen==0){printf("队空，出队失败.\n");return 0;}*x=sq->sequ[(sq->rear-sq->quelen+1+m)%m];sq->quelen--;return x;}1．串采用顺序存储结构，编写朴素模式匹配算法，查找在串中是否存在给定的子串。