ACboy needs your help again!(栈和队列的简单应用或者数组模拟）HDU-1702

ACboy was kidnapped!!
he miss his mother very much and is very scare now.You can’t image how dark the room he was put into is, so poor ?.
As a smart ACMer, you want to get ACboy out of the monster’s labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can’t solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem’s first line is a integer N(the number of commands), and a word “FIFO” or “FILO”.(you are very happy because you know “FIFO” stands for “First In First Out”, and “FILO” means “First In Last Out”).
and the following N lines, each line is “IN M” or “OUT”, (M represent a integer).
and the answer of a problem is a passowrd of a door, so if you want to rescue ACboy, answer the problem carefully!
Input
The input contains multiple test cases.
The first line has one integer,represent the number oftest cases.
And the input of each subproblem are described above.
Output
For each command “OUT”, you should output a integer depend on the word is “FIFO” or “FILO”, or a word “None” if you don’t have any integer.
Sample Input

4
4 FIFO
IN 1
IN 2
OUT
OUT
4 FILO
IN 1
IN 2
OUT
OUT
5 FIFO
IN 1
IN 2
OUT
OUT
OUT
5 FILO
IN 1
IN 2
OUT
IN 3
OUT

Sample Output

1
2
2
1
1
2
None
2
3

题意分析：FIFO表示先进先出（队列的模拟），FILO表示先进后出（栈的模拟）
解题思路：这题可以用栈和队列来写，同时还可以用数组来模拟。以下是我的两种方法。
法一：栈和队列AC代码如下

#include<stdio.h>
#include<queue>
#include<stack>
using namespace std;
char s1[10],s2[10];
int n;
void stac()//此处的函数名要注意别写成了stack,不然编译过不了
{
	stack<int> s;
	int a;
	while(n--)
	{
		scanf("%s",s2);
		if(s2[0]=='I')
		{
			scanf("%d",&a);
			s.push(a);
		}
		else if(s.empty())//如果栈为空是真
			printf("None\n");
		else
		{
			printf("%d\n",s.top());//输出栈顶元素
			s.pop();//弹出栈顶元素
		}
	}
}
void queu()//此处函数名同理
{
	queue<int> q;
	int a;
	while(n--)
	{
		scanf("%s",s2);
		if(s2[0]=='I')
		{
			scanf("%d",&a);
			q.push(a);
		}
		else if(q.empty())//如果队列为空是真
			printf("None\n");
		else
		{
			printf("%d\n",q.front());//输出队首元素
			q.pop();//将队首元素弹出
		}
	}
}
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%s",&n,s1);
		if(s1[2]=='F')
			queu();
		else
			stac();
	}
	return 0;
}

法二：数组模拟法（这个代码理解需要你自己去模拟，我是一遍遍模拟之后写出来的）,AC代码如下

#include<stdio.h>
int main()
{
	int a[2000],i,l,k,T,n,b;
	char s1[10],s2[10];
	scanf("%d",&T);
	while(T--)
	{
		i=l=k=0;
		scanf("%d%s",&n,s1);
		if(s1[2]=='F')
		{
			while(n--)
			{
				scanf("%s",s2);
				if(s2[0]=='I')
				{
					scanf("%d",&b);
					a[i++]=b;
					k++;
				}	
				else
				{
					k--;
					if(k<0)
					{
						printf("None\n");
						i=k=l=0;
					}	
					else
						printf("%d\n",a[l++]);
				}
			}
		}
		else
		{
			while(n--)
			{
				scanf("%s",s2);
				if(s2[0]=='I')
				{
					scanf("%d",&b);
					a[i++]=b;
					k++;
					l++;
				}	
				else
				{
					k--;
					i--;
					if(k<0)
					{
						printf("None\n");
						i=k=l=0;
					}	
					else
						printf("%d\n",a[--l]);
				}
			}
		}
	}
	return 0;
}