jQuery火箭图标返回顶部代码

由于博主比较懒，所以呢循环队列的原理图如下：

代码如下：

#include "stdafx.h"
#include<iostream>
using namespace std;
#define OK 1
#define ERROR 0
#define OVERFLOW -2
#define MAXSIZE 100
typedef int Status;
typedef int QElemType;
typedef struct
{
    QElemType *base;
    int front;
    int rear;
}SqQueue;

Status InitQueue(SqQueue &Q)         //初始化队列
{
    Q.base = new QElemType[MAXSIZE];
    if (!Q.base)
        exit(OVERFLOW);
    Q.front = Q.rear = 0;
    return OK;
}

Status QueueLength(SqQueue Q)        //求队列的长度
{
    return (Q.rear - Q.front + MAXSIZE) % MAXSIZE;
}

Status EnQueue(SqQueue &Q, QElemType e) //进队
{
    if ((Q.rear + 1) % MAXSIZE == Q.front)
        return ERROR;
    Q.base[Q.rear] = e;
    Q.rear = (Q.rear + 1) % MAXSIZE;
    return OK;
}

Status DeQueue(SqQueue &Q, QElemType &e)//出队
{
    if (Q.front == Q.rear)
        return ERROR;
    e = Q.base[Q.front];
    Q.front = (Q.front + 1) % MAXSIZE;
    return OK;
}

QElemType GetHead(SqQueue Q)         //取队头元素 
{
    if (Q.front != Q.rear)
        return Q.base[Q.front];
}

Status Visit(SqQueue Q)              //相当于输出
{
    if (Q.rear == Q.front)
    {
        cout << "空队列" << endl;
        return ERROR;
    }
    while (Q.front != Q.rear)
    {
        cout << Q.base[Q.front] << " ";
        Q.front = (Q.front + 1) % MAXSIZE;
    }
    cout << endl;
    return OK;
}
int main()
{
    SqQueue Q;
    int e;
    InitQueue(Q);
    EnQueue(Q, 1);
    EnQueue(Q, 3);
    EnQueue(Q, 5);
    EnQueue(Q, 7);
    EnQueue(Q, 9);
    Visit(Q);
    cout << "队列的长度为:";
    cout << QueueLength(Q) << endl;
    cout << "循环队列的队头元素为:";
    cout << GetHead(Q) << endl;
    DeQueue(Q, e);
    EnQueue(Q, 11);
    Visit(Q);
    cout << "现在队列的长度为:";
    cout << QueueLength(Q) << endl;
    cout << "现在循环队列的队头元素为:";
    cout << GetHead(Q) << endl;
    return 0;

}

输出结果: