void test(char actual, char expected){
if(actual == expected)
printf("test passed.\n");
else
printf("test failed.\n");
}
//==========================Queue.h=======================
#pragma once
#include <stack>
#include <stdexcept>
using namespace std;
template <typename T> class CQueue{
public:
CQueue(void);
~CQueue(void);
void appendTail(const T& node);
T deleteHead();
private:
stack<T> stack1;
stack<T> stack2;
};
template <typename T> CQueue<T>::CQueue(void){}
template <typename T> CQueue<T>::~CQueue(void){}
template <typename T> void CQueue<T>::appendTail(const T& element){
stack1.push(element);
}
template <typename T> T CQueue<T>::deleteHead(){
if(stack2.size() <= 0){
while(stack1.size() > 0){
T& data = stack1.top();
stack1.pop();
stack2.push(data);
}
}
if(stack2.size() == 0)
throw logic_error("queue is empty");
T head = stack2.top();
stack2.pop();
return head;
}
//==================QueueWithTwoStacks.cpp=================
#include "Queue.h"
#include <cstdio>
int main(){
CQueue<char> queue;
queue.appendTail('a');
queue.appendTail('b');
queue.appendTail('c');
char head = queue.deleteHead();
test(head, 'a');
head = queue.deleteHead();
test(head, 'b');
queue.appendTail('d');
head = queue.deleteHead();
test(head, 'c');
queue.appendTail('e');
head = queue.deleteHead();
test(head, 'd');
head = queue.deleteHead();
test(head, 'e');
}
原文:https://www.cnblogs.com/tangliang39/p/11693838.html