Java日志第54天 2020.8.30

5.11 输入三个字符串,要求将字母按由小到大的顺序输出。

import java.util.Scanner;

public class Demo5_11 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String string1, string2, string3;
        String temp;
        System.out.println("Please input three strings:");
        string1 = sc.next();
        string2 = sc.next();
        string3 = sc.next();

        if (string2 .compareTo(string3)>0) {
            temp = string2;
            string2 = string3;
            string3 = temp;
        }
        if (string1.compareTo(string2) <= 0){
            System.out.println(string1+" "+string2+" "+string3);
        } else if (string1.compareTo(string3) <= 0) {
            System.out.println(string2+" "+string1+" "+string3);
        } else {
            System.out.println(string2+" "+string3+" "+string1);
        }
    }
}

 

 

5.12 一个班有n个学生,需要把每个学生的简单材料(姓名和学号)输入计算机保存。然后可以通过输入某一学生的姓名查找其有关资料。当输入一个姓名后,程序就查找该班中有无此学生,如果有,则输出他的姓名和学号,如果查不到,则输出“本班无此人”。

import java.util.Scanner;

public class Demo5_12 {


    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String find_name;
        String[] name = new String[50];
        String[] num = new String[50];
        int n;
        System.out.print("Please input number of this class:");
        n = sc.nextInt();
        input_data(n,name,num);
//        for (int i = 0; i < n; i++) {
//            System.out.println(name[i]+num[i]);
//        }
        System.out.print("Please input name you want find:");
        find_name = sc.next();
        search(find_name,n,name,num);
    }
    private static void input_data(int n,String name[], String num[]) {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < n; i++) {
            System.out.print("Input name and NO. of student"+(i+1)+":");
            name[i] = sc.next();
            num[i] = sc.next();
        }
    }

    private static void  search(String find_name, int n, String name[],String num[]) {
        boolean flag = false;
        for (int i = 0; i < n; i++) {
            if (name[i].equals(find_name)) {
                System.out.println(name[i] + " has been found, his number is " + num[i]);
                flag = true;
                break;
            }
        }
        if (flag == false)
            System.out.println("Can't find this name");
    }

}

 

posted @   Gazikel  阅读(91)  评论(0编辑  收藏  举报
编辑推荐:
· SQL Server 2025 AI相关能力初探
· Linux系列:如何用 C#调用 C方法造成内存泄露
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
阅读排行:
· 阿里最新开源QwQ-32B,效果媲美deepseek-r1满血版,部署成本又又又降低了!
· SQL Server 2025 AI相关能力初探
· AI编程工具终极对决:字节Trae VS Cursor,谁才是开发者新宠?
· 开源Multi-agent AI智能体框架aevatar.ai,欢迎大家贡献代码
· Manus重磅发布:全球首款通用AI代理技术深度解析与实战指南
点击右上角即可分享
微信分享提示