//队列:先进先出
Queue<int> q = new Queue<int>();
//q.Enqueue();//入队
//q.Dequeue();//出队
q.Enqueue(5);
q.Enqueue(7);
q.Enqueue(2);
while (q.Count>0)
{
int i = q.Dequeue();
Console.WriteLine(i);
}
Console.ReadKey();
//栈:先入后出
Stack<string> s = new Stack<string>();
//s.Push();//压栈
//s.Pop();//出栈
s.Push("A");
s.Push("e");
s.Push("我");
while (s.Count>0)
{
string i = s.Pop();
Console.WriteLine(i);
}
Console.ReadKey();
Queue<int> q = new Queue<int>();
//q.Enqueue();//入队
//q.Dequeue();//出队
q.Enqueue(5);
q.Enqueue(7);
q.Enqueue(2);
while (q.Count>0)
{
int i = q.Dequeue();
Console.WriteLine(i);
}
Console.ReadKey();
//栈:先入后出
Stack<string> s = new Stack<string>();
//s.Push();//压栈
//s.Pop();//出栈
s.Push("A");
s.Push("e");
s.Push("我");
while (s.Count>0)
{
string i = s.Pop();
Console.WriteLine(i);
}
Console.ReadKey();