數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)二報(bào)告模板

趙冬冬java092班2011-4-8PAGEPAGE1數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)2回文判斷班級(jí)：java092學(xué)號(hào)：200907092240姓名：趙冬冬

實(shí)驗(yàn)一回文判斷一、實(shí)驗(yàn)?zāi)康氖炀殫：完?duì)列的各種操作。二、實(shí)驗(yàn)內(nèi)容1．同時(shí)建立一個(gè)棧和一個(gè)隊(duì)列，即：每從鍵盤上輸入一個(gè)字符，就把它作為一個(gè)新的棧和隊(duì)列結(jié)點(diǎn)的數(shù)據(jù)域，插入到棧和隊(duì)列。這樣就同時(shí)建立了一個(gè)棧和一個(gè)隊(duì)列。然后，讓棧出棧的同時(shí)隊(duì)列出隊(duì)，比較它們是相等。2．設(shè)計(jì)簡(jiǎn)單的程序?qū)崿F(xiàn)回文判斷的操作，加注釋！//回文判斷.cpp#include<stdio.h>#include<stdlib.h>typedefstructNode//定義隊(duì)列結(jié)點(diǎn)類型{chardata;structNode*next;}Linkqueuenode;typedefstruct{Linkqueuenode*front;//定義隊(duì)列的對(duì)首指針Linkqueuenode*rear;//定義隊(duì)列的對(duì)尾指針}Linkqueue;typedefstructnode//定義棧結(jié)點(diǎn)類型{chardata;structnode*next;}LinkStackNode,*LinkStack;voidpush(LinkStacktop,charx)//進(jìn)棧{LinkStackNode*temp;//創(chuàng)建新結(jié)點(diǎn)temp=(LinkStackNode*)malloc(sizeof(LinkStackNode));//分配空間temp->data=x;//接點(diǎn)賦值temp->next=top->next;top->next=temp;//數(shù)據(jù)進(jìn)棧}voidgetinmain()//功能界面{printf("\t\t__________________________________________\n");printf("\t\t\t\t回文檢測(cè)\t\t\n");printf("\n\n");printf("\t\t\t\t1.輸入字符串\n");printf("\t\t\t\t2.檢測(cè)是否為回文\n");printf("\t\t\t\t3.退出\n");printf("\n請(qǐng)按指定的數(shù)字進(jìn)行相應(yīng)的操作:\n");}intqueue(Linkqueue*q)//初始化隊(duì)列{q->front=(Linkqueuenode*)malloc(sizeof(Linkqueuenode));//隊(duì)列分配空間if(q->front!=NULL)//判斷隊(duì)是否為空{(diào)q->rear=q->front;//初始化隊(duì)，使隊(duì)為空q->front->next=NULL;return1;}elsereturn0;}intenter(Linkqueue*q,charx)//入隊(duì)操作{Linkqueuenode*newnode;//創(chuàng)建新結(jié)點(diǎn)newnode=(Linkqueuenode*)malloc(sizeof(Linkqueuenode));//隊(duì)列分配空間if(newnode!=NULL){newnode->data=x;//結(jié)點(diǎn)賦值newnode->next=NULL;q->rear->next=newnode;//數(shù)據(jù)入隊(duì)q->rear=newnode;return1;}elsereturn0;}voidpushenter(LinkStacktop,Linkqueue*q)//一個(gè)元素同時(shí)進(jìn)棧和入隊(duì){printf("請(qǐng)輸入元素并以$結(jié)束\n");charx;//進(jìn)棧和入隊(duì)的元素scanf("%c",&x);while(x!='$')//輸入$字符是停止循環(huán){push(top,x);enter(q,x);scanf("%c",&x);//元素同時(shí)進(jìn)棧和入隊(duì)}printf("數(shù)據(jù)進(jìn)棧入列成功！\n");}voidcheck(LinkStacktop,Linkqueue*p)//檢測(cè)是否為回文數(shù){chara,b;intc=0;Linkqueuenode*q;LinkStackw;w=top->next;q=p->front->next;while(q!=NULL&&w->next!=NULL)//判斷隊(duì)列和棧是否為空{(diào)a=w->data;//隊(duì)列和棧不為空則進(jìn)行出隊(duì)和出棧操作b=q->next->data;q=q->next;w=w->next;printf("a=%cb=%c\n",a,b);if(a!=b)//檢測(cè)是否為回文數(shù) { c=1; printf(">>>>>>>>>>>>>>>>不為回文<<<<<<<<<<<<<<<<<\n");break; }}if(c==0)printf("\n>>>>>>>>>>>>>>>>為回文<<<<<<<<<<<<<<<<<\n");}voidmain(){LinkStackNodetop;//聲明一個(gè)棧結(jié)點(diǎn)top.next=NULL;//將棧頂值為空Linkqueueq;queue(&q);//初始化隊(duì)列system("pause");system("cls");s:getinmain();//進(jìn)入功能選擇界面intb;scanf("%d",&b);//選擇功能switch(b){case1:pushenter(&top,&q);system("pause");system("cls"); gotos;case2:check(&top,&q);system("pause");system("cls"); gotos;case3