c#递归实现螺旋数组

最新推荐文章于 2022-03-25 17:55:48 发布

weixin_34266504

最新推荐文章于 2022-03-25 17:55:48 发布

阅读量145

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/kexb/p/3660381.html

本文介绍了一个使用C#实现的螺旋填充二维数组的算法。通过递归的方式，从数组的中心开始向外螺旋填充数字，最终形成一个7x7的矩阵。

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication5
{
class Program
{
public static int[,] a = new int[7, 7];
public static int count = 0;
public static int row = 0;
public static int col = 0;
public static int RowMax = 6;
public static int RowMin = 0;
public static int ColMax = 6;
public static int ColMin = 0;
public static int shangzuo1 = 0;

public static bool c = false;
public static int p = 0;
public static int q = 0;
static void Main(string[] args)
{
digui();
int n = 7;
if(n%2!=0)
a[n / 2, n/ 2] = n*n;
for (int i = 0; i < 7; i++)
for (int j = 0; j < 7; j++)
{
Console.Write(a[i, j] + "\t");
if (j == 6)
Console.WriteLine();

}
Console.ReadLine();
}

public static void digui()
{

while (p == 0 && q == 0)
{
count++;
if (count > 49)
return;
if (c==true)
{
col++;
row++;
ColMin++;
ColMax--;
RowMin++;
RowMax--;
c = false;

}

if (col > ColMax)
{

q = 1;

col--;
count--;
if(count<49)

digui();

}
else
{

a[row, col] = count;
if (count == 49)
return;

col++;
}

}
while (p == 0 && q == 1)
{
count++;
if (count > 49)
return;

row++;
if (row > RowMax)
{

p = 1;

row--;
count--;
if (count < 49)
digui();

}
else
{
a[row, col] = count;
if (count == 49)
return;

}

}
while (p == 1 && q == 1)
{
count++;

if (count >49)
return;
col--;
if (col < ColMin)
{

q = 0;

col++;
count--;
if (count <49)
digui();

}
else
{

a[row, col] = count; if (count == 49)
return;

}

}
while (p == 1 && q == 0)
{
count++;
if (count >49)
return;
row--;

if (row < RowMin)
{

p = 0;
c = true;

row++;
count-=2;
if (count <49)
digui();

}
else
{

if(row>RowMin)
a[row, col] = count; if (count == 49)
return;

}

}
}
}
}

转载于:https://www.cnblogs.com/kexb/p/3660381.html