用c#
输出为:
----*
---*-*
--*-*-*
-*-*-*-*
*-*-*-*-*
------解决方案--------------------------------------------------------
没啥要求吗?那这样好了:
Console.WriteLine( "----* ");
Console.WriteLine( "---*-* ");
Console.WriteLine( "--*-*-* ");
Console.WriteLine( "-*-*-*-* ");
Console.WriteLine( "*-*-*-*-* ");
Console.ReadLine();
------解决方案--------------------------------------------------------
for(int i=1;i <=5;i++)
{
for(int j=1;j <=5-i;j++)
{
Console.Write( "- ");
}
for(int k=1;k <i;k++)
{
Console.Write( "*- ");
}
Console.WriteLine( "* ");
}
Console.ReadLine();
------解决方案--------------------------------------------------------
呵呵.再改一下:
public static void Main()
{
Test(12,12);
Console.ReadLine();
}
private static void Test(int row,int col)
{
for(int i=1;i <=row;i++)
{
for(int j=1;j <=col-i;j++)
{
Console.Write( "- ");
}
for(int k=1;k <i;k++)
{
Console.Write( "*- ");
}
Console.WriteLine( "* ");
}
}
------解决方案--------------------------------------------------------
输出等腰三角形
using System;
using System.Collections;
namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
Out3(7);
}
static void Out3(int iStep)
{
int iMax = 2 * iStep - 1;//最多的星号
string sPrefix = " ";//前面的后格
string sOther = " ";
string sStar = "* ";
for (int i = 1; i <= iStep; i++)
{
Console.Write(sPrefix);
for (int j = 0; j < iMax / 2 + 1 - i; j++)
Console.Write(sOther);
int count = 2 * i - 1;
for (int j = 0; j < count; j++)
Console.Write(sStar);
Console.WriteLine();
}
}
}
}