stack与queue

1.stack

#include<deque.h> 
template <class T,class Sequence = deque<T>>
class stack
{
public:
    typedef typename Sequence::value_type value_type;
    typedef typename Sequence::size_type size_type;
    typedef typename Sequence::reference reference;
    typedef typename Sequence::const_reference const_reference;
protected:
    Sequence c;
public:
    bool empty() const
    {
        return c.empty();
    }
    size_type size() const
    {
        return c.size();
    }
    reference top() const
    {
        return c.back;
    }
    const_reference top() const
    {
        return c.back;
    }
    void push(const value_type& x)
    {
        c.push_back(x);
    }
    void pop()
    {
        c.pop_back;
    }
    bool operator == (const stack<T, Sequence>& x, const stack<T, Sequence>& y)
    {
        return x.c == y.c;
    }
    bool operator < (const stack<T, Sequence>& x, const stack<T, Sequence>& y)
    {
        return x.c < y.c;
    }
};

2.queue

template<class T , class Sequence = deque<T>>
class queue

{
public:
    typedef typename Sequence::value_type value_type;
    typedef typename Sequence::size_type size_type;
    typedef typename Sequence::reference reference;
    typedef typename Sequence::const_reference const_reference;
protected:
    Sequence c;
public:
    bool empty() const
    {
        return c.empty();
    }
    size_type size() const
    {
        return c.size();
    }
    reference front()
    {
        return c.front();
    }
    const_reference front() const
    {
        return c.front();
    }
    reference back()
    {
        return c.back();
    }
    const_reference back() const
    {
        return c.back();
    }

    void push(const value_type& x)
    {
        c.push_back(x);
    }
    void pop()
    {
        c.pop_front();
    }
    bool operator == (const stack<T, Sequence>& x, const stack<T, Sequence>& y)
    {
        return x.c == y.c;
    }
    bool operator < (const stack<T, Sequence>& x, const stack<T, Sequence>& y)
    {
        return x.c < y.c;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值