输出结果:
*
* * *
* * * * *
* * * * * * *
* * * * *
* * *
*
算法:
public void PrintLinXing(int num)
{
if (num % 2 == 0)
{
num--;
}
for (int r = 0; r <= num / 2; r++)
{
int mid = num / 2 + 1;
int begin = mid - r;
int ed = mid + r;
for (int c = 0; c <= ed; c++)
{
if (c < begin)
Console.Write( " ");
else
Console.Write( "* ");
}
Console.Write("/n");
}
for (int r = 0; r <= num / 2; r++)
{
int mid = num / 2 + 1;
int begin = r + 1;
int ed = num - r - 1;
for (int c = -1; c < ed; c++)
{
if (c < begin)
Console.Write(" ");
else
Console.Write("* ");
}
Console.Write("/n");
}
}