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();
             stack.Push();
             stack.Push();
             stack.Push();
             stack.Push();
             stack.Push();
             stack.Push();

             stacksReverses.reverse(stack);

             Console.ReadLine();
         }

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