小算法：将一整数逆序后放入一数组中（要求递归实现）

static void Main(string[] args)

        {

            int m = 1236578;

            int[] ms = new int[m.ToString().Length];

            Rev(m.ToString().Length, m, ref ms);

            for (int i = 0; i < m.ToString().Length; i++)

                Console.Write("{0}", ms[i]);

            Console.ReadLine();

        }



 private static void Rev(int len, int m, ref int[] ms)

        {

            if (m / 10 > 0)

            {

                ms[len - m.ToString().Length] = m % 10;

                Rev(len, m / 10, ref ms);

                return;

            }

            ms[len - m.ToString().Length] = m % 10;

        }