打印杨辉三角形,可自己传参来确定行数
public static int[,] YH(int lines)
{
int[,] arr = new int[lines, lines];
for (int i = 0; i < arr.GetLength(0); i++)
{
for (int j = 0; j <=i; j++)
{
if (i==j || j==0)
{
arr[i, j] = 1;
}
else
{
arr[i, j] = arr[i - 1, j] + arr[i - 1, j - 1];
}
}
}
return arr;
}
public static void Print(int[,] arr)
{
for (int i = 0; i < arr.GetLength(0); i++)
{
for (int k = 0; k < arr.GetLength(0)-1-i; k++)
{
Console.Write(" ");
}
for (int j = 0; j <=i; j++)
{
Console.Write(arr[i,j] +" ");
}
Console.WriteLine();
}
}
得到图形如下:
判断质数:
public static int Task01(int endNumber)
{
int sum = 0;
for (int i = 1; i < endNumber; i++)
{
if (IsPrime(i))
{
sum += i;
}
}
return sum;
}
/// <summary>
/// 判断一个数字是否为质数
/// </summary>
/// <param name="number">待判定的数</param>
static bool IsPrime(int number)
{
if (number<2)
{
return false;
}
for (int i = 2; i < number; i++)
{
if (number%i==0)
{
return false;
}
}
return true;
}