int[] number = new int[] { 1, 2, 3, 45, 34546 };
int temp = 0;
for (int i = 0; i < number.Length; i++)
{
if (number[i] > temp)
{
temp = number[i];
}
}
Console.WriteLine("最大值为" + temp);
Console.ReadKey();
int[] number = new int[] { 345, 34543, -4356};
int min = int.MaxValue ;
int max = int.MinValue ;
for (int i = 0; i < number.Length; i++)
{
if (number[i] > max)
{
max = number[i];
}
if (number[i] < min)
{
min = number[i];
}
}
Console.WriteLine("最大值为" + max);
Console.WriteLine("最小值为" + min);
Console.ReadKey();
冒泡排序:
注意循环的轮数,每一次循环比较几次,需要比较几轮;
冒泡排序用array 函数进行排序:
int[] num = new int[] { 345, 345, 45, 454 };
Array.Sort(num); //排序
Array.Reverse(num);//这个方法是反转;
for (int i = 0; i < num.Length; i++)
{
Console.WriteLine(num[i]+ "\t");
}
Console .ReadKey ();
异常处理结构
int[] num = { 1, 1, 1, 1 };
//num[8] = 90;
try
{
num[8] = 90;
}
catch
{
Console.WriteLine("提示出现异常");
}
finally
{
Console.WriteLine("执行结束");
}
方法的调用;
static void Main(string[] args)
{
Console.WriteLine("请输入年份");
string str = Console.ReadLine();
int yearint = Convert.ToInt32(str);
bool result = Years(yearint);
Console.WriteLine(result);
Console.ReadKey();
}
public static bool Years(int year)
{
if (year%400==0||year%4==0 && year%100!=0)
{
return true;
}
else
{
return false;
}