完整版学生管理系统
具有登陆功能,用户名为 admin 以及密码
查询学生信息
修改学生信息
删除学生信息
- 先写一个Student类
package com.briup.day19.work;
public class Student {
private String no; // 学号
private String name; // 姓名
private String gender; // 性别
private String room; // 班级
// getter setter
public String getNo() {
return no;
}
public void setNo(String no) {
this.no = no;
}
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;
}
public String getRoom() {
return room;
}
public void setRoom(String room) {
this.room = room;
}
// 无参构造器
public Student() {
}
// 有参构造器
public Student(String no, String name, String gender, String room) {
super();
this.no = no;
this.name = name;
this.gender = gender;
this.room = room;
}
@Override
public String toString() {
return no + ", " + name + ", " + gender + ", " + room;
}
}
- 再写一个学生管理类StudentM,里面有remove()、update()、search()方法,分别对学生信息进行删除、修改与查找。需要先登录admin才能使用此功能。
package com.briup.day19.work;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
public class StudentM {
static Map<Integer, Student> map = new HashMap<>();
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
add();
home();
}
public static void home() {
System.out.print("请输入用户名:");
String uu = sc.nextLine();
System.out.print("请输入密码:");
String pp = sc.nextLine();
if (uu.equals("admin") && pp.equals("admin")) {
System.out.println("欢迎进入学生信息管理系统!");
while (true) {
System.out.println("请输入序号:");
Scanner sc = new Scanner(System.in);
System.out.println("1.查询学生信息");
System.out.println("2.删除学生信息");
System.out.println("3.修改学生信息");
System.out.println("4.退出系统");
int print = sc.nextInt();
if (print == 4) {
break;
}
switch (print) {
case 1:
search();
break;
case 2:
remove();
break;
case 3:
update();
break;
}
}
} else {
System.out.println("信息有误,登录失败!请重新输入!");
}
System.out.println("感谢使用!");
}
public static void add() {
map.put(160101, (new Student("160101", "lisi1", "Man1", "class1")));
map.put(160102, (new Student("160102", "lisi2", "Man2", "class1")));
map.put(160103, (new Student("160103", "lisi3", "Man3", "class1")));
map.put(160104, (new Student("160104", "lisi4", "Man4", "class1")));
map.put(160105, (new Student("160105", "lisi5", "Man5", "class1")));
}
public static void update() {// 修改学生信息
System.out.println("请输入想要修改的学生信息序号:");
Scanner sc = new Scanner(System.in);
System.out.println("1.将学号160101的学生信息修改为wangwu1的信息");
System.out.println("2.将学号160102的学生信息修改为wangwu2的信息");
System.out.println("3.将学号160103的学生信息修改为wangwu3的信息");
System.out.println("4.将学号160104的学生信息修改为wangwu4的信息");
System.out.println("5.将学号160105的学生信息修改为wangwu5的信息");
int print = sc.nextInt();
switch (print) {
case 1:
map.put(160101, (new Student("160101", "wangwu1", "Female1", "class2")));
break;
case 2:
map.put(160102, (new Student("160102", "wangwu2", "Female2", "class2")));
break;
case 3:
map.put(160103, (new Student("160103", "wangwu3", "Female3", "class2")));
break;
case 4:
map.put(160104, (new Student("160104", "wangwu4", "Female4", "class2")));
break;
case 5:
map.put(160105, (new Student("160105", "wangwu5", "Female5", "class2")));
break;
default:
System.out.println("信息输入有误,请重新输入:");
break;
}
}
public static void remove() {// 删除学生信息
System.out.print("请输入想要删除的学生学号:");
Student student = map.remove(sc.nextInt());
System.out.println(student+"信息已删除。");
}
public static void search() {// 查找学生信息
Set<java.util.Map.Entry<Integer, Student>> set = map.entrySet();
for (java.util.Map.Entry<Integer, Student> entry : set) {
System.out.println(entry.getKey() + ":" + entry.getValue()); }
/*
//迭代器遍历
for(Iterator<Entry<Integer, Student>> iter = set.iterator();
iter.hasNext();) { Map.Entry entry = (Map.Entry)iter.next();
Integer key = (Integer) entry.getKey(); Student value = (Student)
entry.getValue(); System.out.println(key +":" + value); }
*/
/*Collection values = map.values(); // 获取Map集合的value集合
for (Object object : values) {
System.out.println(object.toString()); // 输出键值对象
}*/
}
}
总结
写得很乱,菜鸟级别的。
代码串在一起就好神奇,Java是个神奇的语言。