队列和栈

            Stack<int> s = new Stack<int>();//后进先出

            s.Push(1);//把元素放入“栈”

            s.Push(2);

            s.Push(3);

            Console.WriteLine(s.Pop());//Pop从栈中取出顶上第一个元素。出栈

            Console.WriteLine(s.Pop());

            Console.WriteLine(s.Pop());

 

            //Queue<int> q = new Queue<int>();//队列，先进先出

            //q.Enqueue(1);//入队

            //q.Enqueue(2);

            //q.Enqueue(3);

            //Console.WriteLine(q.Dequeue());//出队

            //Console.WriteLine(q.Dequeue());

            //Console.WriteLine(q.Dequeue());