Student类:
public class Student {
String name;
String sex;
public Student() {
}
public Student(String name, String sex) {
this.name = name;
this.sex = sex;
}
//学生自我介绍
public void introduce() {
System.out.println(this.name + " " + this.sex);
}
}
测试类:
public class Test04 {
public static void main(String[] args) {
//定义长度为10的学生数组,来存储学生数据
Student[] stus = new Student[10];
stus[0] = new Student("11", "男");
stus[1] = new Student("22", "女");
//定义变量,记录实际的学生数量
int count = 2;
Scanner scanner = new Scanner(System.in);
System.out.println("======================");
System.out.println("欢迎使用学生管理系统");
System.out.println("======================");
while (true) {
System.out.println("1.查看学生 2.添加学生 3.修改学生 4.删除学生");
System.out.print("请选择:");
int choose = scanner.nextInt();
switch (choose) {
case 1:
System.out.println("你选择了查看学生");
System.out.println("编号\t姓名\t性别");
for (int i = 0; i < count; i++) {
System.out.print((i + 1) + "\t");
System.out.print(stus[i].name + "\t");
System.out.println(stus[i].sex + "\t");
}
break;
case 2:
System.out.println("你选择了添加学生");
System.out.println("请输入学生的姓名:");
String name = scanner.next();
System.out.println("请输入学生的性别:");
String sex = scanner.next();
//在数组中存储一个学生,count作为新元素的下标
stus[count] = new Student(name, sex);
//学生数量加1
count++;
break;
case 3:
System.out.println("你选择了修改学生");
for (int i = 0; i < count; i++) {
System.out.print((i + 1) + "\t");
System.out.print(stus[i].name + "\t");
System.out.println(stus[i].sex + "\t");
}
System.out.println("请输入学生的编号:");
int bh = scanner.nextInt();
System.out.println("请输入修改后的学生的姓名:");
String rname = scanner.next();
System.out.println("请输入学生的性别:");
String rsex = scanner.next();
stus[bh - 1] = new Student(rname, rsex);
break;
case 4:
System.out.println("你选择了删除学生");
for (int i = 0; i < count; i++) {
System.out.print((i + 1) + "\t");
System.out.print(stus[i].name + "\t");
System.out.println(stus[i].sex + "\t");
}
int dbh = scanner.nextInt();
for (int i = dbh - 1; i < count; i++) {
stus[i] = stus[i + 1];
}
stus[count] = null;
count--;
break;
default:
System.out.println("结束");
return;
}
}
}
}
欢迎访问,多多推荐~