栈与队列的存储及操作实验

1. 数制转换问题。将十进制数转换成二到九之间的任一进制数输出。

#include<iostream>
#include<stack>
using namespace std;
void Dec_RY(int a,int b)
{
int c;
stack<int> S;
while(a!=0)
{
c=a%b;
S.push(c);
a/=b;
}
while(!S.empty())
{
cout<<S.top();
S.pop();
} }
int main()
{
Dec_RY(435,2);
return 0; }

 

结果图

2.顺序存储结构循环队列的实现。

//利用取模方法实现循环队列
#include <iostream>

#define MAX_SIZE 5

using namespace std;
typedef int DataType;
typedef struct t
{
	DataType data[MAX_SIZE];
	int front;
	int rear;
}SeqQueue;

int initQueue(SeqQueue* &SQ)
{
	SQ = new SeqQueue;
	if (!SQ) return 0;
	SQ->front = SQ->rear = 0;
	return 1;
}

//判断队列是否为满，利用取余方法实现循环
int isFull(SeqQueue* &SQ)
{
	if (!SQ) return 0;
	if ((SQ->rear + 1) % MAX_SIZE == SQ->front)
	{
		cout << "队列已满" << endl;
		return 1;
	}
	return 0;
}

//判断是否为空
int isEmpty(SeqQueue* &SQ)
{
	if (!SQ || SQ->front==SQ->rear)
	{
		cout << "队列为空" << endl;
		return 1;
	}
	return 0;
}

//入队,队列是否为满
int enterQueue(SeqQueue* &SQ, DataType data)
{
	if (!SQ)return 0;
	if (isFull(SQ))return 0;
	SQ->data[SQ->rear] = data;
	SQ->rear = (SQ->rear + 1) % MAX_SIZE;
	return 1;
}

//打印
void printQueue(SeqQueue* &SQ)
{
	if (isEmpty(SQ)) return;
	int i = SQ->front;
	while (i!=SQ->rear)
	{
		cout << SQ->data[i] << "\t";
		i = (i + 1) % MAX_SIZE;
	}
	cout << endl;
}

//出队
int deleteQueue(SeqQueue*& SQ, DataType& data)
{
	if (isEmpty(SQ)) return 0;
	data = SQ->data[SQ->front];
	SQ->front = (SQ->front + 1) % MAX_SIZE;
	return 1;
}

//求队列存储数数据，个数
int getLength(SeqQueue*& SQ)
{
// 	if (SQ->front > SQ->rear) return SQ->rear + MAX_SIZE - SQ->front;
// 	if (SQ->front <= SQ->rear) return SQ->rear - SQ->front;
	//合并
	return (SQ->rear - SQ->front + MAX_SIZE) % MAX_SIZE;
}

void clearQueue(SeqQueue*& SQ)
{
	if (!SQ) return;
	SQ->front = SQ->rear = 0;
}

int main()
{
	SeqQueue* SQ = NULL;
	DataType data = 0;
	if (initQueue(SQ)) cout << "循环链表初始化成功!" << endl;
	else cout << "循环队列初始化失败!" << endl;
	for (int i = 0; i < 10; i++)
	{
		if (enterQueue(SQ, i))cout << i << "插入成功!" << endl;
	}
	cout << "元素个数为:" << getLength(SQ) << endl;
	printQueue(SQ);
	if (deleteQueue(SQ, data))cout << data << "成功出队" << endl;
	cout << "元素个数为:" << getLength(SQ) << endl;
	printQueue(SQ);
	clearQueue(SQ);
	system("pause");
	return 0;
}

结果图