N×N矩阵螺旋打印输出

例：
1 2 3
4 5 6
7 8 9
输出为如下结果
1;4;7;8;9;6;3;2;5;

    private void button1_Click(object sender, EventArgs e)
    {
        //测试例子初始化，并将数组显示到控制台
        int[,] intArray = new int[5, 8];
        int intPos = 0;
        Console.WriteLine();
        for (int i = 0; i < 5; i++)
        {
            for (int j = 0; j < 8; j++)
            {
                intPos++;
                intArray[i, j] = intPos;

                Console.Write(intPos.ToString().PadRight(4));
            }
            Console.WriteLine();
        }

        Console.WriteLine();

        this.PrintArray(1, intArray);
    }

    private void PrintArray(int intPos, int[,] array)
    {
        int intRow = array.GetLength(0);
        int intCell = array.GetLength(1);

        //只要任何没有输出的内容，就无需继续
        bool blnFlag = false;
        //左边
        for (int i = intPos - 1; i <= intRow - intPos; i++)
        {
            blnFlag = true;
            Console.Write(array[i, intPos - 1].ToString() + " ");
        }

        if (blnFlag)
        {
            blnFlag = false;
            //下边
            for (int i = intPos; i <= intCell - intPos; i++)
            {
                blnFlag = true;
                Console.Write(array[intRow - intPos, i].ToString() + " ");
            }
        }

        if (blnFlag)
        {
            //右边
            blnFlag = false;
            for (int i = intRow - intPos - 1; i >= intPos - 1; i--)
            {
                Console.Write(array[i, intCell - intPos].ToString() + " ");
                blnFlag = true;
            }
        }

        if (blnFlag)
        {
            //上边
            blnFlag = false;
            for (int i = intCell - intPos - 1; i >= intPos; i--)
            {
                Console.Write(array[intPos - 1, i].ToString() + " ");
                blnFlag = true;
            }
        }

        if (!blnFlag)
        {
            return;
        }
        else
        {
            this.PrintArray(intPos + 1, array);
        }

    }

转载于:https://www.cnblogs.com/kelebing/archive/2009/08/11/1543447.html