zoukankan      html  css  js  c++  java
  • C# 数组练习题及答案解析

    1、根据班级人数创建一个数组,要求每个人的姓名都要放进去
    Console.Write("请输入班级人数:");
    int n = int.Parse(Console.ReadLine());
    string[] name = new string[n];
    for (int i = 0; i < n; i++)
    {
    Console.Write("请输入第{0}个人的姓名:", i + 1);
    name[i] = Console.ReadLine();
    }
    Console.WriteLine("输入完毕,请按回车键查看!");
    Console.ReadLine();
    Console.WriteLine();
    for (int i = 0; i < n; i++)
    {
    Console.Write(name[i] + " ");
    }
    Console.ReadLine();

    2、从控制台输入班级人数
        将每个人的年龄放入数组,
        将所有人的年龄求总和
        求平均年龄
    求年龄最大
    Console.Write("请输入班级人数:");
    int n = int.Parse(Console.ReadLine());
    int[] age = new int[n];
    int sum = 0;
    for (int i = 0; i < n; i++)
    {
    Console.Write("请输入第{0}个人的年龄:", i + 1);
    age[i] = int.Parse(Console.ReadLine());
    sum += age[i];
    }
    Console.WriteLine("年龄总和为:"+sum);
    Console.WriteLine("平均年龄为:"+(sum / n));
    Console.ReadLine();
    int agemax = 0;
    for (int i = 0; i < n; i++)
    {
    if (agemax < age[i])
    {
    agemax = age[i];
    }
    }
    Console.WriteLine("最大年龄是:" + agemax);
    Console.ReadLine();

    3、冒泡排序(经典)
    for (int i = 0; i < n; i++)
    {
    for (int j = i; j < n - 1; j++)
    {
    if (age[i] < age[j + 1])
    {
    int zhong = age[i];
    age[i] = age[j + 1];
    age[j + 1] = zhong;
    }
    }
    }

    for (int i = 0; i < n; i++)
    {
    Console.WriteLine(age[i]);
    }
    Console.ReadLine();


    4、输入班级人数
        输入每个人的分数
        求总分、平均分、两个最高分,两个最低分
    Console.Write("请输入班级的人数:");
    int n = int.Parse(Console.ReadLine());
    double[] b = new double[n];
    double fen = 0;
    for (int i = 0; i < n; i++)
    {
    Console.Write("请输入第{0}个学生的分数:", i + 1);
    b[i] = double.Parse(Console.ReadLine());
    fen += b[i];
    }
    Console.WriteLine("总分为:" + fen);
    Console.WriteLine("平均分为:" + (fen / n));
    Console.ReadLine();

    for (int i = 0; i < n; i++)
    {
    for (int j = i; j < n - 1; j++)
    {
    if (b[i] < b[j + 1])
    {
    double zhong = b[i];
    b[i] = b[j + 1];
    b[j + 1] = zhong;
    }
    }
    }
    Console.WriteLine("两个最高分为:" + b[0] + "," + b[1]);

    Console.ReadLine();
    Console.WriteLine("两个最低分为:" + b[n - 1] + "," + b[n - 2]);

    Console.ReadLine();

  • 相关阅读:
    JDBC初体验
    Linux的常用命令--文件的相关操作
    Spring框架之AOP的基本配置
    坦克大战系列7-策略分析之扫描策略和移动策略
    坦克大战系列8-策略分析之瞄准策略
    CF846F Random Query
    CF388C Fox and Card Game
    CF1097F Alex and a TV Show
    CF1276C Beautiful Rectangle
    [SDOI2016]征途
  • 原文地址:https://www.cnblogs.com/hcx999/p/5721281.html
Copyright © 2011-2022 走看看