C#螺旋矩阵,终于写出来了

using System;

namespace lx
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.WriteLine("输入行数");
            int row = int.Parse(Console.ReadLine());
            Console.WriteLine("输入列数");
            int column = int.Parse(Console.ReadLine());
            int[,] array = new int[row, column];
            int sum = row * column;
            Console.WriteLine();
            Print(0, 0, 1, row, column, sum, ref array);
            Write(ref row, ref column, ref array);
            Console.ReadKey();
        }
        public static void Write(ref int row, ref int column, ref int[,] array)
        {
            for (int i = 0; i < row; i++)
            {
                for (int j = 0; j < column; j++)
                {
                    if (array[i, j] < 10)
                    {
                        Console.Write(array[i, j] + "    ");
                    }
                    else if (array[i, j] < 100)
                    {
                        Console.Write(array[i, j] + "   ");
                    }
                    else if (array[i, j] < 1000)
                    {
                        Console.Write(array[i, j] + "  ");
                    }
                    else
                    {
                        Console.Write(array[i, j] + " ");
                    }
                }
                Console.WriteLine();
            }
        }
        public static void Print(int x, int y, int num, int row, int column, int sum, ref int[,] array)
        {
            int i,j;
            ///→
            for (j = y; j < column && array[x, j] == 0 && num <= sum; j++)
            {
                array[x, j] = num++;
                y = j;
            }
            x++;
            //↓
            for (i = x; i < row && array[i, y] == 0 && num <= sum; i++)
            {
                array[i, y] = num++;
                x = i;
            }
            y--;
            //←
            for (j = y; j >= 0 &&x>=0&& array[x, j] == 0 && num <= sum; j--)
            {
                array[x, j] = num++;
                y = j;
            }
            x--;
            //↑
            for (i = x; i >= 0 &&y>=0&& array[i, y] == 0 && num <= sum; i--)
            {
                array[i, y] = num++;
                x = i;
            }
            if (num > sum)//到最大值结束程序
            {
                return;
            }
            else
            {
                Print(x, y + 1, num, row, column, sum, ref array);
            }
        }
    }
}