stackqueue.cpp

来自「this implement stack」· C++ 代码 · 共 109 行

#include<iostream.h>
#include<conio.h>

struct queues
{
int queue[10];
int first;
int last;
void add(int &el)
{
int i=last;
queue[i]=el;
last++;
}
int del()
{
int i=first;
first++;
return queue[i];
}
};   
struct stacks
{
int stack[10];
int top;

void push(int &el)
{
int i=top;
stack[i]=el;
top++;
}
int pop()
{
int i=top;
return stack[i];
top--;
}
};

int main()
{
	int a,b,c;
	queues q;
	stacks s;
	cout<<"for begin queue program press 1 "<<endl;
	cout<<"for begin stack program press 2 "<<endl;
	cin>>a;
	if (a==1)
	{
		while (b!=4)
		{
		cout<<"to add     element press 1 "<<endl;
		cout<<"to remove  element press 2 "<<endl;
		cout<<"to see     queue   press 3 "<<endl;
		cout<<"exit ====================4 "<<endl;
		cin>>b;
		if(b==1)
		{
			cout<<"enter value"<<endl;
			cin>>c;
			q.add(c);
		}
		if(b==2)
		{
			q.del();
		}
		if(b==3)
		{
			for(int i=0;i<=10;i++)
			{
				cout<<q.queue[i];
			}
		}
		}
		
	}
	if (a==2)
	{
		while (b!=4)
		{
		cout<<"to push    element press 1 "<<endl;
		cout<<"to pop     element press 2 "<<endl;
		cout<<"to see      stack  press 3 "<<endl;
		cout<<"exit ====================4 "<<endl;
		cin>>b;
		if(b==1)
		{
			cout<<"enter value"<<endl;
			cin>>c;
			s.push(c);
		}
		if(b==2)
		{
			s.pop();
		}
		if(b==3)
		{
			for(int i=0;i<=10;i++)
			{
				cout<<s.stack[i];
			}
		}
		}
	}

return 0;
}