zoukankan      html  css  js  c++  java
  • 查找学员

    package cn.home;
    
    public class Student {
            private String name;
            private String gender;
            public Student() {}
            public Student(String name, String gender) {
                super();
                this.name = name;
                this.gender = gender;
            }
            public String getName() {
                return name;
            }
            public void setName(String name) {
                this.name = name;
            }
            public String getGender() {
                return gender;
            }
            public void setGender(String gender) {
                this.gender = gender;
            }
            
    }
    package cn.home;
    import java.util.HashMap;
    import java.util.Iterator;
    import java.util.Map;
    import java.util.Scanner;
    import java.util.Set;
    
    public class Test {
            static Scanner sc = new Scanner(System.in);
            public static void main(String[] args) {
                Map<String, Student> students = new HashMap<String, Student>();
                students.put("Jack",new Student("李明","男") );
                students.put("Mike",new Student("张三","男") );
                students.put("Rose",new Student("小红","女"));
                students.put("John",new Student("王五","男"));
    //            Set<String> keys = students.keySet();
    //            Iterator<String> itor = keys.iterator();
    //            while(itor.hasNext()) {
    //                
    //                String s1 = itor.next();
    //                Student value = students.get(s1);
    //                System.out.println(s1+"的学员姓名是:"+value.getName()+",性别是"+value.getGender());
    //            }
                System.out.println("请输入要查找的英文名:");
                String xname = sc.next();
                if(students.containsKey(xname)) {
                    Student stu = students.get(xname);
                    System.out.println("你要找的是"+stu.getName()+","+stu.getGender());
                }else {
                    System.out.println("查无此人");
                }
            }
    }

  • 相关阅读:
    Hanoi塔问题
    《OD学hive》第六周20160731
    《OD学Hive》第六周20160730
    《OD学Sqoop》数据转换工具Sqoop
    《OD学hive》第五周0723
    《OD学hive》第四周0717
    《OD学hadoop》第四周0716
    hadoop环境搭建笔记
    《OD学hadoop》第三周0710
    《OD学hadoop》第三周0709
  • 原文地址:https://www.cnblogs.com/lev1/p/11261933.html
Copyright © 2011-2022 走看看