新建 文本文档.txt

来自「九宫图代码」· 文本 代码 · 共 77 行

九宫方图 
给你一个奇数，例如3 
生成如下表格 
8   1   6   
3   5   7   
4   9   2   
例如5 
生成如下表格 
17   25   1       8   15   
24     5   7     14   16 
  4     6   13   20   23 
10   12   19   22     3   
11   18   21     2     9   

public static int[,] getArrayNumber(int readNumber)
        {
            int maxNumber = readNumber * readNumber;
            int [,] arrNumber=new int[readNumber,readNumber];
            int column = readNumber / 2;
            int row = 0;
            for (int i = 1; i <= maxNumber; i++)
            {  
                if (row < 0)
                {
                    row = readNumber - 1;
                    if (column > readNumber - 1)
                    {
                        column = 0;
                        if (arrNumber[row, column] != 0)
                        {
                            row =1;
                            column = readNumber - 1;
                        }
                    }
                    else
                    {
                        if (arrNumber[row, column] != 0)
                        { 
                            row = 1;                            
                        }                        
                    }
                }
                else if (column > readNumber - 1)
                {
                    column = 0;
                    if (arrNumber[row, column] != 0)
                    {
                        row = row + 2;
                        if (row > readNumber-1)
                        {
                            row = 0;
                        }
                        column = readNumber - 1;
                    }
                }
                else 
                {
                    if (arrNumber[row, column] != 0)
                    {                        
                        row = row + 2;
                        if (row > readNumber-1)
                        {
                            row = 0;
                        }
                        column = column - 1;
                        if (column < 0)
                        {
                            column = readNumber-1;
                        }
                    }
                }

                arrNumber[row, column] = i;
                row--; column++;
            }
            return arrNumber;
        }