栈和队列在实现上非常类似, 是否可以用栈实现队列?
问题分析 :
用栈实现队列等价于用“后进先出”的特性实现 "先进先出" 的特性!
实现思路
准备两个栈用于实现队列: stack_in 和 stack_out
▪ 当有新元素入队时:将其压入stack_in
▪ 当需要出队时:
★ stack_out.size() == 0 ;
将stack_in中的元素逐—弹出并压入stack_out
将stack_out的栈顶元素弹出
★ stack_out.size() > 0 ;
将stack_out的栈顶元素弹出
#include <iostream>
#include "LinkQueue.h"
#include "LinkStack.h"
using namespace DTlib;
using namespace std;
template < typename T >
class StackToQueue : public Queue<T>
{
protected:
mutable LinkStack<T> m_stack_in;
mutable LinkStack<T> m_stack_out;
void move() const
{
if(m_stack_out.size() == 0)
{
while(m_stack_in.size() > 0)
{
m_stack_out.push(m_stack_in.top());
m_stack_in.pop();
}
}
}
public:
void add(const T& e)
{
m_stack_in.push(e);
}
void remove()
{
move();
if(m_stack_out.size() > 0)
{
m_stack_out.pop();
}
else
{
THROW_EXCEPTION(InvalidOperationException, "No element in current queue...");
}
}
T front() const
{
move();
if(m_stack_out.size() > 0)
{
return m_stack_out.top();
}
else
{
THROW_EXCEPTION(InvalidOperationException, "No element in current queue...");
}
}
void clear()
{
m_stack_in.clear();
m_stack_out.clear();
}
int length() const
{
return m_stack_in.size() + m_stack_out.size();
}
};
int main()
{
StackToQueue<int> sq;
for(int i=0; i<10; i++)
{
sq.add(i);
}
while(sq.length() > 0)
{
cout << sq.front() << " ";
sq.remove();
}
return 0;
}
反之,是否可以用队列实现栈?
问题分析
本质为,用队列“先进先出”的特性实现栈“后进先出”的特性!
实现思路
-准备两个队列用于实现栈: queue_1[in]和queue_2[out]
▪ 当有新元素入栈时:将其加入队列[in]
▪ 当需要出栈时:
★ 将队列[in]中的n-1个元素出队列,并进入队列[out]中
★ 将队列[in]中的最后—个元素出队列(出栈)
★ 交换两个队列的角色: queue_1[in]和queue_2[out]
#include <iostream>
#include "LinkQueue.h"
#include "LinkStack.h"
using namespace DTlib;
using namespace std;
template < typename T >
class QueueToStack : public Stack<T>
{
protected:
LinkQueue<T> m_queue_1;
LinkQueue<T> m_queue_2;
LinkQueue<T>* m_pIn;
LinkQueue<T>* m_pOut;
void move() const
{
int n = m_pIn->length() - 1;
for(int i = 0; i < n; i++)
{
m_pOut->add(m_pIn->front());
m_pIn->remove();
}
}
void swap()
{
LinkQueue<T>* temp = NULL;
temp = m_pIn;
m_pIn = m_pOut;
m_pOut = temp;
}
public:
QueueToStack()
{
m_pIn = &m_queue_1;
m_pOut = &m_queue_2;
}
void push(const T& e)
{
m_pIn->add(e);
}
void pop()
{
if(m_pIn->length() > 0)
{
move();
m_pIn->remove();
swap();
}
else
{
THROW_EXCEPTION(InvalidOperationException, "No element in current stack ...");
}
}
T top() const
{
if(m_pIn->length() > 0)
{
move();
return m_pIn->front();
}
else
{
THROW_EXCEPTION(InvalidOperationException, "No element in current stack ...");
}
}
void clear()
{
m_queue_1.clear();
m_queue_2.clear();
}
int size() const
{
return m_queue_1.length() + m_queue_2.length();
}
};
int main()
{
QueueToStack<int> sq;
for(int i=0; i<10; i++)
{
sq.push(i);
}
while(sq.size() > 0)
{
cout << sq.top() << " ";
sq.pop();
}
return 0;
}