数据结构–栈和队列
栈
后进先出
顺序栈:
int InitStack(SqStack &s){
S.base = new ElemType[MAXSIZE]
if(!S.base) return OVERFLOW;
S.top=S.base;
S.Stacksize = MAXSIZE;
return OK;
}
int Push(SqStack &s,ElemType &e){
if(S.top-S.base==S.Stacksize) return ERROR;
*S.top++=e;
return ok;
}
int Pop(SqStack &s,ElemType &e){
if(S.top==S.base) return ERROR;
e = *--S.top;
return ok;
}
int GetTop(SqStack S){
if(S.top!=S.base)
return *(S.top-1);
}
链栈:
int InitStack(LinkStack &S){
S=NULL;
return OK;
}
int Push(LinkStack &S,SElemType e){
p=new StackNode;
p->data=e;
p->next=S;
S=p;
return OK;
}
int Pop(LinkStack &S,SElemType e){
if(S==NULL) return ERROR;
e = S->data;
p = S;
S = S->next;
delete p;
return OK;
}
int GetTop(LinkStack S){
if(S!=NULL){
return S->data;
}
}
队列
先进先出
循环队列:
队空:Q.front=Q.rear
队满:(Q.rear+1)%MAXQSIZE = Q.front
#include <bits/stdc++.h>
using namespace std;
#define MAXQSIZE 1000
#define QElemType int
#define OK 1
#define OVERFLOW -1
#define Status int
#define ERROR -2
typedef struct
{
QElemType *base;
int front;
int rear;
} SqQueue;
Status InitQueue(SqQueue &Q)
{
Q.base = new QElemType[MAXQSIZE];
if (!Q.base)
exit(OVERFLOW);
Q.front = Q.rear = 0;
return OK;
}
int QueueLenght(SqQueue Q)
{
return (Q.rear - Q.front + MAXQSIZE) % MAXQSIZE;
}
Status InQueue(SqQueue &Q, QElemType e)
{
if ((Q.rear + 1) % MAXQSIZE == Q.front)
return ERROR;
Q.base[Q.rear] = e;
Q.rear = (Q.rear + 1) % MAXQSIZE;
return OK;
}
Status DeQueue(SqQueue &Q, QElemType e)
{
if (Q.front == Q.rear)
return ERROR;
e = Q.base[Q.front];
Q.front = (Q.front + 1) % MAXQSIZE;
return OK;
}
QElemType GetHead(SqQueue Q)
{
if (Q.front != Q.rear)
return Q.base[Q.front];
}
链队:
//有空再补充
案例分析和实现
数值的转换
伪代码:
void conversion(int n){
InitStack(S);
while(n){
push(S,N%8);
n=n/8;
}
while(!StackEmpty(S)){
pop(S,e);
cout<<e;
}
}