C#=>递归反转栈

原理，递归反转栈

using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;

namespace StacksReverse
{
    public class Program
    {
        public void Main(string[] args)
        {
            StacksReverses stacksReverses = new StacksReverses();
            Stack<int> stack = new Stack<int>();

            stack.Push(1);
            stack.Push(2);
            stack.Push(3);
            stack.Push(4);
            stack.Push(5);
            stack.Push(6);
            stack.Push(7);

            stacksReverses.reverse(stack);

            Console.ReadLine();
        }

        public class StacksReverses
        {
            public int GetAndRemoveLastElement(Stack<int> stack)
            {
                int result = stack.Pop();
                if (stack.Count() == 0) return result;
                int last = GetAndRemoveLastElement(stack);
                stack.Push(result);
                return last;
            }
            public void reverse(Stack<int> stack)
            {
                if (stack.Count() == 0) return;
                int i = GetAndRemoveLastElement(stack);
                reverse(stack);
                stack.Push(i);
            }
        }
    }
}