main.cpp

浙江工商大学 计算机与信息工程学院实验报告

#include <stack>
#include <queue>
#include <iostream>
using namespace std;

bool tran(char *s)
{
	int i;
	stack <char> sta;

	for (i = 0 ; s[i] ; i++)
		sta.push(s[i]);

	for (i = 0 ; !sta.empty() ; i++)
	{
		s[i] = sta.top();
		sta.pop();
	}

	return true;
}

class Queue
{
private:
	int que[512];
	int frone;
	int rear;
	int size;
public:
	Queue(void)
	{
		frone = rear = 0;
		size = 512;
	}

	bool full(void)
	{
		return (rear + 1) % size == frone;
	}

	bool empty(void)
	{
		return frone == rear;
	}

	bool app(int n)
	{
		if (full()) return false;
		que[rear] = n;
		rear = (rear + 1) % size;
		return true;
	}

	int del(void)
	{
		int tmp = que[frone];
		if (empty()) return false;
		frone = (frone + 1) % size;
		return tmp;
	}

	int length(void)
	{
		return (size + rear - frone) % size;
	}
};

int main(void)
{
#ifdef NUM
	char s[] = "hello redraiment";
	
	tran(s);
	cout << s << endl;
#else
	Queue Q;

	for (int i = 0 ; i < 4 ; i++)
		Q.app(rand() % 1000);
	Q.app(100);
	Q.app(37);
	cout << Q.length() << endl;
	while (!Q.empty())
		cout << Q.del() << ' ';
	cout << endl;
#endif

	return 0;
}