Map集合编写简单的单选题管理系统

编程入门 行业动态 更新时间:2024-10-17 11:21:17

Map集合编写简单的单选题<a href=https://www.elefans.com/category/jswz/34/1769858.html style=管理系统"/>

Map集合编写简单的单选题管理系统

测试类(Demo)

package 单选题管理系统;import java.util.Map;
import java.util.TreeMap;public class Demo {public static void main(String[] args) {// TODO 自动生成的方法存根Map<Integer, Testdanxuan> map=new TreeMap<Integer, Testdanxuan>();Testdanxuan.menu(map);//在Testdanxuan类中编写menu方法,用来执行单选题管理系统,此处直接调用}}

主类(Testdanxuan)

package 单选题管理系统;import java.io.ObjectInputFilter.Status;
import java.util.Map;
import java.util.Objects;
import java.util.Scanner;public class Testdanxuan {private String genji;//题干private String optionA;private String optionB;private String optionC;private String optionD;//题目的选项private String answer;//答案 private boolean status=false;public Testdanxuan() {super();}public Testdanxuan( String genji, String optionA, String optionB, String optionC, String optionD,String answer, boolean status) {super();this.genji = genji;this.optionA = optionA;this.optionB = optionB;this.optionC = optionC;this.optionD = optionD;this.answer = answer;this.status = status;}public String getGenji() {return genji;}public void setGenji(String genji) {this.genji = genji;}public String getOptionA() {return optionA;}public void setOptionA(String optionA) {this.optionA = optionA;}public String getOptionB() {return optionB;}public void setOptionB(String optionB) {this.optionB = optionB;}public String getOptionC() {return optionC;}public void setOptionC(String optionC) {this.optionC = optionC;}public String getOptionD() {return optionD;}public void setOptionD(String optionD) {this.optionD = optionD;}public String getAnswer() {return answer;}public void setAnswer(String answer) {this.answer = answer;}public boolean isStatus() {return status;}public void setStatus(boolean status) {this.status = status;}@Overridepublic int hashCode() {return Objects.hash(answer, genji, optionA, optionB, optionC, optionD, status);}@Overridepublic boolean equals(Object obj) {if (this == obj)return true;if (obj == null)return false;if (getClass() != obj.getClass())return false;Testdanxuan other = (Testdanxuan) obj;return Objects.equals(answer, other.answer) && Objects.equals(genji, other.genji)&& Objects.equals(optionA, other.optionA) && Objects.equals(optionB, other.optionB)&& Objects.equals(optionC, other.optionC) && Objects.equals(optionD, other.optionD)&& status == other.status ;}@Overridepublic String toString() {return "."+genji+"\n"+optionA+"\n"+optionB+"\n"+optionC+"\n"+optionD+"\n"+"答案: "+answer+"\n"+"删除状态: "+status;}public static void menu(Map<Integer, Testdanxuan> map) {map.put(1, new Testdanxuan("小白兔喜欢吃的是:","A:小鱼","B:松果","C:胡萝卜","D:辣椒","D",false));while(true) {System.out.println("====================================");System.out.println("==============单选题考试系统============");System.out.println("====================================");System.out.println("1.显示题库;2.查看试题;3.删除试题;4.添加试题;5.退出系统");System.out.println("(操作说明:请输入操作代码1或2或3或4。)");System.out.println("====================================");System.out.println("请输入操作代码:");Scanner sc=new Scanner(System.in);int n=sc.nextInt();switch (n) {case 1: showExam(map);break;case 2:findExam(map);break;case 3:deleteExam(map);case 4:addExam(map);case 5:System.out.println("谢谢使用单选题考试系统!");System.exit(0);default:throw new IllegalArgumentException("Unexpected value: " + n);}}}public static void showExam(Map<Integer, Testdanxuan> map) {// TODO 自动生成的方法存根for(Map.Entry<Integer,Testdanxuan> i:map.entrySet()) {System.out.println(i.getKey()+""+i.getValue());}}public static void findExam(Map<Integer, Testdanxuan> map) {System.out.println("请输入您所需要查看的题号:");Scanner sc=new Scanner(System.in);int a=sc.nextInt();Integer A=new Integer(a);for(Map.Entry<Integer, Testdanxuan> i:map.entrySet()) {if(A.equals(i.getKey())) {System.out.println("查询到的题目为:");System.out.println(i.getKey()+""+i.getValue());}}}public static void deleteExam(Map<Integer, Testdanxuan> map) {System.out.println("请输入您所需要删除的题号:");Scanner sc=new Scanner(System.in);int a=sc.nextInt();Integer A=new Integer(a);for(Map.Entry<Integer, Testdanxuan> i:map.entrySet()) {if(A.equals(i.getKey())) {System.out.println("要删除的内容为:"+i.getKey()+""+i.getValue());map.remove(A);System.out.println("删除成功!");}else {System.out.println("删除错误!没有该题号的内容!");}}}public static void addExam(Map<Integer, Testdanxuan> map) {System.out.println("请输入您所需要添加的题号:");Scanner sc=new Scanner(System.in);int m=sc.nextInt();//Integer M=new Integer(m);for(Map.Entry<Integer, Testdanxuan> i:map.entrySet()) {if(m==(i.getKey())) {System.out.println("此题号已有,请勿重复添加!请重新输入题号:");m=sc.nextInt();}Integer M=new Integer(m);System.out.println("请输入题干:");String genji=sc.next();System.out.println("请输入选项A:");String optionA=sc.next();System.out.println("请输入选项B:");String optionB=sc.next();System.out.println("请输入选项C:");String optionC=sc.next();System.out.println("请输入选项D:");String optionD=sc.next();System.out.println("请输入答案:");String answer=sc.next();boolean status=false;map.put(M, new Testdanxuan(genji,optionA,optionB,optionC,optionD,answer,status));System.out.println("添加成功!");System.out.println("是否返回到上一页面?Y/N");String kString=sc.next();if(kString.equals("Y")) {Testdanxuan.menu(map);}}}
}

更多推荐

Map集合编写简单的单选题管理系统

本文发布于:2024-02-27 13:47:46,感谢您对本站的认可!
本文链接:https://www.elefans.com/category/jswz/34/1706788.html
版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。
本文标签:管理系统   简单   单选题   Map

发布评论

评论列表 (有 0 条评论)
草根站长

>www.elefans.com

编程频道|电子爱好者 - 技术资讯及电子产品介绍!