蛇形填数

最新推荐文章于 2025-03-19 21:59:28 发布

原创最新推荐文章于 2025-03-19 21:59:28 发布 · 145 阅读

CC 4.0 BY-SA版权

本文介绍了一种使用枚举和静态方法实现的二维数组螺旋填充算法。通过定义方向枚举和一个获取螺旋填充二维数组的方法，实现了从1开始，按螺旋顺序填充到指定大小的二维数组中。该算法首先初始化数组，然后根据当前方向移动并填充数值，当遇到边界或已填充单元格时改变方向。

enum Direct{
Up,
Down,
Left,
Right
}

static int[][] GetTwoDimensionArr(int lineNum)
{
Direct direct = Direct.Down;
int val = 1;
int[][] arr = new int[lineNum][];
for (int i = 0; i < arr.Length; i++)
{
arr[i] = new int[lineNum];
}
int currLine = 0, currRow = 0;
while (val != Math.Pow(lineNum,2))
{
arr[currLine][currRow] = val;
switch (direct)
{
case Direct.Up:
if (currLine == 0 || arr[currLine - 1][currRow] != 0)
{
direct = Direct.Left;
currRow--;
}
else
{
currLine--;
}
break;
case Direct.Down:
if (currLine == lineNum - 1 || arr[currLine + 1][currRow] != 0)
{
direct = Direct.Right;
currRow++;
}
else
{
currLine++;
}
break;
case Direct.Left:
if (currRow == 0 || arr[currLine][currRow - 1] != 0)
{
direct = Direct.Down;
currLine++;
}
else
{
currRow--;
}
break;
case Direct.Right:
if (currRow == lineNum - 1 || arr[currLine][currRow + 1] != 0)
{
direct = Direct.Up;
currLine--;
}
else
{
currRow++;
}
break;
default:
break;
}
val++;
}
return arr;
}

static void Main(string[] args){

int[][] arr = GetTwoDimensionArr(10);
for (int i = 0; i < arr.Length; i++)
{
for (int j = 0; j < arr[i].Length; j++)
{
Console.Write(arr[i][j] + "\t");
}
Console.Write("\n");
}

}