#include<iostream>
#include<cstdlib>
using namespace std;typedef struct stack { int *s; int stacksize; int top; }stack; void init_stack(stack *s,int n) { s->stacksize=n; s->s=(int*)malloc(sizeof(int)*s->stacksize); s->top=0; } bool stack_empty(stack *s) { if(s->top==0) return true; else return false; } bool stack_full(stack *s) { if(s->top==s->stacksize) return true; else return false; } void push(stack *s,int x) { if(stack_full(s)) { cout<<"overflow"<<endl; exit(1); } s->top=s->top+1; s->s[s->top]=x; } int pop(stack *s) { int x; if(stack_empty(s)) { cout<<"underflow"<<endl; exit(1); } x=s->s[s->top]; s->top--; return x; } int top(stack *s) { return s->s[s->top]; } int main() { stack s; init_stack(&s,100); push(&s,19); push(&s,23); push(&s,34); push(&s,76); push(&s,65); cout<<"top is "<<top(&s)<<endl; pop(&s); cout<<"top is "<<top(&s)<<endl; }

#include<iostream>
#include<cstdlib>
using namespace std;typedef struct queue { int *q; int head,tail; int queuesize; }queue; void init_queue(queue *q,int n) { q->queuesize=n; q->q=(int*)malloc(sizeof(int)*q->queuesize); q->tail=q->head=0; } bool queue_empty(queue *q) { if(q->head==q->tail) return true; else return false; } bool queue_full(queue *q) { if(q->tail+1==q->head) return true; else return false; } int queue_length(queue *q) { return (q->tail-q->head+q->queuesize)%q->queuesize; } void enqueue(queue *q,int x) { if(queue_full(q)) { cout<<"queue overflow"<<endl; exit(1); } q->q[q->tail]=x; q->tail=(q->tail+1)%q->queuesize; } int dequeue(queue *q) { int x; if(queue_empty(q)) { cout<<"queue underflow"<<endl; exit(1); } x=q->q[q->head]; q->head=(q->head+1)%q->queuesize; return x; } int main() { queue q; init_queue(&q,100); enqueue(&q,10); enqueue(&q,30); cout<<"head: "<<q.head<<" tail: "<<q.tail<<endl; cout<<"value="<<dequeue(&q)<<endl; cout<<"value="<<dequeue(&q)<<endl; cout<<"head: "<<q.head<<" tail: "<<q.tail<<endl; enqueue(&q,10); exit(0); }

#include<iostream>
#include<stack>
#include<cstdlib>
using namespace std;template <typename T>
class StackToQueue { public: T dequeue(); void enqueue(const T &node); StackToQueue(){} ~StackToQueue(){} private: stack<T> stack1; stack<T> stack2; }; template <typename T> void StackToQueue<T>::enqueue(const T &node) { stack1.push(node); } template <typename T> T StackToQueue<T>::dequeue() { if(stack2.empty()&&stack1.empty()) { cout<<"underflow"<<endl; exit(1); } if(stack2.empty()&&!stack1.empty()) { while(!stack1.empty()) { T temp=stack1.top(); stack1.pop(); stack2.push(temp); } } T data=stack2.top(); stack2.pop(); return data; } int main() { StackToQueue<int> sq; sq.enqueue(1); sq.enqueue(2); sq.enqueue(3); cout<<sq.dequeue()<<endl; cout<<sq.dequeue()<<endl; cout<<sq.dequeue()<<endl; cout<<sq.dequeue()<<endl; }

#include<iostream>
#include<queue>
#include<cstdlib>
using namespace std;template <typename T>
class QueueToStack { public: QueueToStack(){} ~QueueToStack(){} T pop(); void push(const T &node); private: queue<T> queue1; queue<T> queue2; }; template <typename T> T QueueToStack<T>::pop() { T data; if(queue1.empty()&&queue2.empty()) { cout<<"underflow"<<endl; exit(1); } if(!queue1.empty())//对工作的队列进行操作  {　　　　　//出队到队列中只剩下一个元素，就可以出栈了 while(queue1.size()>1) { T temp=queue1.front(); queue1.pop(); queue2.push(temp); } data=queue1.front(); queue1.pop(); } else if(!queue2.empty()) { while(queue2.size()>1) { T temp=queue2.front(); queue2.pop(); queue1.push(temp); } data=queue2.front(); queue2.pop(); } return data; } template <typename T> void QueueToStack<T>::push(const T &node) { if(!queue1.empty())//每次都压入到工作的队列中  queue1.push(node); else queue2.push(node); } int main() { QueueToStack<int> queue; queue.push(1); queue.push(2); queue.push(3); cout<<queue.pop()<<endl; cout<<queue.pop()<<endl; cout<<queue.pop()<<endl; }