[Data Structure]栈&队列的实现

const int maxsize = 1e4 + 5;
struct stack{
    int data[maxsize];
    int Top;
    stack(){Top = -1;}
    void clear(){Top = -1;}
    bool push(int x){
        if(Top == maxsize-1)
            return false;

        data[++Top] = x;
        return true;
    }
    bool pop(){
        if(Top == -1) return false;
        else Top--;
    }
    int top(){return data[Top];}
    bool isempty(){
        if(Top == -1)return true;
        return false;
    }
};

struct queue{
    int data[maxsize];
    int head, tail;

    queue(){head = tail = 0;}
    void clear(){head = tail = 0;}

    int front(){
        if(head == tail)
            return -1;
        else
            return data[head];
    }

    bool push(int x){
        if(tail != maxsize-1)
            data[tail++] = x;
        else
            return false;
        return true;
    }

    bool pop(){
        if(head == tail){
            head = tail = 0;
            return false;
        }
        else
            head++;
        return true;
    }

    bool isempty(){
        if(head == tail){
            head = tail = 0;
            return true;
        }    
        else return false;
    }
};