順序表和順序隊(duì)列

1、/順序棧.Cpp#include "stdio. h"Sinclude "stdlib. h"#define mO 100/指定順序棧的最大空間typedef struct SeqStack /順序棧存儲(chǔ)結(jié)構(gòu)定義,struct指向結(jié)構(gòu)體的變量的指針char datamO;int top;SeqStack;SeqStack *Init_SeqStack()/初始化空棧 SeqStack*s;s= (SeqStack *)malloc(sizeof (SeqStack) : / (類型說明符*) malloc(size)分配內(nèi)存空間函數(shù)mallocs->

2、;top二0;return s:int Empty_SeqStack(SeqStack *s) /判空棧if (s->top二二0)return 1;else return 0;int Push_SeqStack (SeqStack *s, char x)/入棧if (s->top=m0)printf (-棧滿不能入棧!n");return 0;elses->datas->top+=x;return 1;int Pop_SeqStack(SeqStack char &x) /出棧 if (Empty_SeqStack (s ) printff?？詹荒艹?/p>

3、棧！ n");return 0;elsex=s->data-s->top;return 1;char Top_SeqStdck(SeqStack *s) /取棧頂元素 辻(Empty_SeqStack ( s ) ) return 0;/*?？?/else return (s->data-s->top);void mainO /主函數(shù)，測(cè)試順序棧的基本操作SeqStack *stack; char x;stack二 Init_SeqStack() ;/初始化空棧Push_SeqStack(stack,'&');/&、b、c 三個(gè)

4、元素相繼入棧Push_SeqStdck(stack,' b)；Push_SeqStack(stack,' c)；x=Top_SeqStack (stack) ;/取棧頂元素，并輸出printf （"當(dāng)前棧頂元素是：%cnz，, x）;stack->top+;printfCtB棧序列:)；棧中元素依次出棧Pop_SeqStack (stack, x);printf("%cn",x);Pop_SeqStack (stack, x);printf("%cn",x);Pop_SeqStack (stack, x);printf(&

5、quot;%cn",x);順序隊(duì)列.cpp#include stdio. h#include stdlib. h"define mO 100/指定順序隊(duì)列的最大空間typedef struct SeqQueue /順序棧存儲(chǔ)結(jié)構(gòu)定義,struct指向結(jié)構(gòu)體的 變量的指針char datamO;int front, rear; /隊(duì)列頭、尾指針；front二rear二0,初始化空隊(duì)列SeqQueue;SeqQueue * Init_SeqQueue ()/初始化空隊(duì)列 SeqQueue *q;q= (SeqQueue *)malloc(sizeof (SeqQueue) ;

6、/ (類型說明符*) malloc(size)分配內(nèi)存空間函數(shù)mallocq->fro nt 二 q -;return q;int Empty_SeqQueue(SeqQueue *q) /判空隊(duì)列 if (q->front=q->rear) return 1;else return 0;int In_SeqQueue (SeqQueue *q, char x)/入隊(duì)列if (q->front=(q->rear+l)% mO)printf (“隊(duì)列滿不能入隊(duì)列！ n");return 0;else q->dataq->rear+=x;retu

7、rn 1;int Out_SeqQueue (SeqQueue *q, char &x) /出隊(duì)列 if (Empty_SeqQueue (q ) printff隊(duì)列空不能出隊(duì)列! n");return 0;elsex=q->dataq->front+;return 1;char Top_SeqQueue (SeqQueue *q) /取隊(duì)列頂元素 if ( Empty_SeqQueue (q) ) return 0;/*隊(duì)列空*/else return (q->dataq->front);void mainO /主函數(shù)，測(cè)試順序隊(duì)列的基本操作SeqQueue *queue; char x;queue= Init_SeqQueue () ;/初始化空隊(duì)列In_SeqQueue(queue,')；/&、b、c三個(gè)元素相繼入隊(duì)列In_SeqQueue(queue,' b)；In_SeqQueue(queue,' c)；x=Top_SeqQueue (queue) ;/取棧頂元素，并輸出 printf C當(dāng)前隊(duì)列頂端元素是:%cn", x);queue->rear+;printff出隊(duì)列序列:n) ; /隊(duì)列中元素依次出隊(duì)列Out_SeqQueue(queue,