原题链接
这道题还是有点有趣的,我们首先需要了解堆栈是后进先出,队列是先进先出这一特点,然后根据这一特点来用堆栈模拟队列
入队列:
- s1未满,s2空:元素入栈s1
- s1满,s2非空:输出错误:已满
- s1满,s2空:将s1的元素倒入s2,将新元素入栈s1
- s1未满,且非上面的情况:元素入栈s1
if(isfull(s1)!=1 && isempty(s2)){
push(&s1,elem);
}else if(isfull(s1) && isempty(s2)){
while(isempty(s1)!=1){
push(&s2,pop(&s1));
}
push(&s1,elem);
}else if(isfull(s1) && isempty(s2)!=1){
printf("ERROR:Full\n");
}else if(isfull(s1)!=1){
push(&s1,elem);
}
出队列:
- s2非空:s2出栈
- s1非空,s2空:将s1导入s2,s2出栈
- s1空,s2空:输出错误:空
if(isempty(s2)!=1){
printf("%d\n",s2.x[--s2.size]);
}else if(isempty(s2) && isempty(s1)!=1){
while(isempty(s1)!=1){
push(&s2,pop(&s1));
}
printf("%d\n",s2.x[--s2.size]);
}else if(isempty(s1) && isempty(s2)){
printf("ERROR:Empty\n");
}
#include <stdio.h>
#include <stdlib.h>
typedef struct{
int x[10000];
long long size;
long long maxsize;
}stack;//定义一个栈的数据类型
int isfull(stack s){
if(s.size>=s.maxsize){
return 1;
}else{
return 0;
}
}//栈满返回1,否则返回0
int isempty(stack s){
if(s.size==0){
return 1;
}else{
return 0;
}
}//栈空返回1,否则返回0
void push(stack *s,int e){
s->x[s->size++]=e;
}//入栈
int pop(stack *s){
return s->x[--s->size];
}//出栈
int main(){
int elem;
long long n,n1,n2;
char o;
scanf("%lld %lld",&n1,&n2);
if(n2<n1){
n=n1;
n1=n2;
n2=n;
}//令s1,s2分别为容量较小的栈和容量较大的栈
stack s1,s2;
s1.maxsize=n1;
s2.maxsize=n2;
s1.size=0;
s2.size=0;
getchar();
scanf("%c",&o);
while(o!='T'){
if(o=='A'){
scanf("%d",&elem);
if(isfull(s1)!=1 && isempty(s2)){
push(&s1,elem);
}else if(isfull(s1) && isempty(s2)){
while(isempty(s1)!=1){
push(&s2,pop(&s1));
}
push(&s1,elem);
}else if(isfull(s1) && isempty(s2)!=1){
printf("ERROR:Full\n");
}else if(isfull(s1)!=1){
push(&s1,elem);
}
}else if(o=='D'){
if(isempty(s2)!=1){
printf("%d\n",s2.x[--s2.size]);
}else if(isempty(s2) && isempty(s1)!=1){
while(isempty(s1)!=1){
push(&s2,pop(&s1));
}
printf("%d\n",s2.x[--s2.size]);
}else if(isempty(s1) && isempty(s2)){
printf("ERROR:Empty\n");
}
}
scanf("%c",&o);
}
}