C++循环队列
来源:互联网 发布:域名跟网址的区别 编辑:程序博客网 时间:2024/06/05 22:41
#include <iostream>
using namespace std;
class Queue
{
int front;
int rear;
int maxsize;
int *data;
public:
Queue(int n){ data = new int[n]; maxsize = n; front = rear = 0; }
void enQueue(int);
void deQueue(int &);
int getLength();
void print();
};
void Queue::print()
{
for (int i = 0; i < getLength(); i++)
cout << data[i] << endl;
}
int Queue::getLength()
{
return (rear - front + maxsize) % maxsize;
}
void Queue::enQueue(int a)
{
if ((rear + 1) % maxsize == front)
cout << "队列满" << endl;
else
{
data[rear] = a;
rear = (rear + 1) % maxsize;
}
}
void Queue::deQueue(int &a)
{
if (rear == front)
cout << "队列空" << endl;
else
{
a = data[front];
front = (front + 1) % maxsize;
}
}
int main()
{
int t,n;
cin >> t;
Queue k(n+1);
for (int i = 0; i < n; i++)
{
cin >> data;
k.enQueue(data);
}
cout << k.getLength() << endl;
k.print();
}
system("pause");
}
using namespace std;
class Queue
{
int front;
int rear;
int maxsize;
int *data;
public:
Queue(int n){ data = new int[n]; maxsize = n; front = rear = 0; }
void enQueue(int);
void deQueue(int &);
int getLength();
void print();
};
void Queue::print()
{
for (int i = 0; i < getLength(); i++)
cout << data[i] << endl;
}
int Queue::getLength()
{
return (rear - front + maxsize) % maxsize;
}
void Queue::enQueue(int a)
{
if ((rear + 1) % maxsize == front)
cout << "队列满" << endl;
else
{
data[rear] = a;
rear = (rear + 1) % maxsize;
}
}
void Queue::deQueue(int &a)
{
if (rear == front)
cout << "队列空" << endl;
else
{
a = data[front];
front = (front + 1) % maxsize;
}
}
int main()
{
int t,n;
cin >> t;
int data;
//t个例子
while (t-- > 0){
//n个数字
cin >> n;Queue k(n+1);
for (int i = 0; i < n; i++)
{
cin >> data;
k.enQueue(data);
}
cout << k.getLength() << endl;
k.print();
}
system("pause");
}
阅读全文
0 0
- c循环队列
- C的循环队列
- 循环队列实现(C++)
- C语言循环队列
- C基础:循环队列
- 循环队列(C语言版)
- C循环队列
- C-循环队列
- C 循环队列实现
- 循环队列(c)
- c语言:循环队列
- 循环队列 - C语言
- C语言 循环队列
- 循环队列 c 实现!!!!
- 【C++】实现循环队列
- 【C语言】循环队列
- 循环队列(C/C++)
- C ~ 链式队列与循环队列
- C++双向链表
- 1018. 锤子剪刀布 (20)
- 设计一个有getMin功能的栈 程序员代码面试指南
- MyBatis学习总结(六)——调用存储过程
- 2017.10.19总结
- C++循环队列
- 约瑟夫环时间复杂度O(n)解法
- java网络编程—Reactor
- 安卓开发之ListView
- 04-树4 是否同一棵二叉搜索树(25 分)
- jdbc:oracle:thin:@ip:1521:orcl(详解)
- C++链栈 及 链队列
- 二分查找 6不6(Java实现)
- Java集合框架01-Collection架构与源码分析