类实现循环队列

ZXT____

已于 2023-05-10 09:00:48 修改

阅读量314

点赞数

文章标签： java 算法 c++

于 2023-05-09 19:44:35 首次发布

本文链接：https://blog.csdn.net/ZXT____/article/details/130587298

版权

main

#include "head.h"

int main()
{
    Stack stack;

    stack.push(1);
    stack.push(2);
    stack.push(3);
    stack.push(4);
    stack.push(5);
    stack.push(6);
    stack.push(7);
    stack.push(8);

    stack.show();
    cout << "-------------" << endl;
    stack.len();
    cout << "-------------" << endl;




    stack.pop();
    stack.show();
    cout << "-------------" << endl;

    stack.len();

    stack.push(8);
    stack.show();
    return 0;
}

function.cpp

#include "head.h"

//判空  1是空了，0是没空
int Stack::isEmpty()
{
    if(front == rear)
       return 1;
    return 0;
}

//判满   1是满了，0是没满
int Stack::isFull()
{
    if(front == (rear+1)% MAXSIZE)
        return 1;
    return 0;
}



int Stack::push(datatype data)
{
    if(isFull())
        return -1;

    this->data[rear] = data;
    rear = (rear+1)%MAXSIZE;

    return  0;
}

int Stack::pop(){
    if(isEmpty())
        return -1;
    front = (front+1)%MAXSIZE;

    return 0;
}

void Stack::show()
{
    if(isEmpty())
        return ;
    for(int i = front; i != rear; i=(i+1)%MAXSIZE)
    {
        cout << data[i] << endl;
    }
}


int Stack::len()
{
    cout <<  (MAXSIZE-q->front+q->rear)%MAXSIZE; << endl;
    return  (MAXSIZE-q->front+q->rear)%MAXSIZE;
}

head.h

#ifndef HEAD_H
#define HEAD_H
#include <iostream>

#define MAXSIZE 8
using namespace std;
typedef int datatype;
class Stack
{
public: Stack()
    {
        this->front = 0;
        this->rear = 0;
    }

    int isEmpty();
    int isFull();
    int push(datatype data);
    int pop();
    void show();


    int len();
private:
    datatype data[MAXSIZE];
    int front;//对头
    int rear;//队尾
};
#endif // HEAD_H