main.cpp

Microsoft 面试常考算法 Implementation of Queue using 2 Stacks.

#include <iostream.h>
#include <stdlib.h>
#include <stack>

std::stack <int> stk1, stk2;

void push(int elem){
	stk1.push(elem);
}

int pop(){
	int elem=-1;

	if(!stk2.empty()){
		elem=stk2.top();
		stk2.pop();
	}
	else{
		while(!stk1.empty()){
			stk2.push(stk1.top());
			stk1.pop();
		}
		elem=stk2.top();
		stk2.pop();
	}


	return elem;
}

void main(){
	int i;
	for(i=0;i<10;i++)
		push(i);
	for(i=0;i<10;i++)
		cout<<pop();
	cout<<endl;
}