使用hashmap实现一个简单的学生管理系统，可添加、删除、查看

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.Set;

public class StudentManager{
	
  private static final boolean TRUE = false;
  HashMap<Integer,String> map=new HashMap<>();
  static StudentManager student=new StudentManager();
	
	public static void  main(String args[]){
	
		student.Info();
		student.show();
		student.deal(); 
	}
	
	public static void show() 
	{
		System.out.println("-功能菜单");
		System.out.println("0--学生信息");
		System.out.println("1--删除学生");
		System.out.println("2--增加学生");
	}
		
	public void Info()
    {
		map.put(1,"卢本伟");
		map.put(2,"王二");
		map.put(7,"五五开");
		map.put(8,"white");		
	}
	
	public void StudentShow() 
    {
		System.out.println("-学生信息-");
	    Iterator it=map.entrySet().iterator();
		while(it.hasNext()) {
			Map.Entry<Integer, String> entry= (Map.Entry<Integer, String>)it.next();//遍历map
			System.out.println("学号"+entry.getKey()+"姓名"+entry.getValue());
				
		}
		student.next();
	}
				
	public void DeleteStudent(){
		int i=0;
		Scanner st=new Scanner(System.in);
		while(true)
    {	
		System.out.println("请输入要删除的学生学号");
			if(st.hasNextInt()){
				i=st.nextInt();
				map.remove(i);
				System.out.println("删除的学号是"+i+"的学生");
				break;
			}
			else{
				System.out.println("输入有误!");
				break;
			}}
		student.next();
			}
		
	public  void PutStudent() {
		int j=0; String name;
		Scanner sc = new Scanner(System.in);
		System.out.println("请输入要添加的学生学号");
		j= sc.nextInt();
		System.out.println("请输入要添加的学生姓名");
		name = sc.next();
		map.put(j,name);
		System.out.println("添加成功");
		student.next();
		}
	
	public static void next() 
    {	
		System.out.println("是否继续操作Y/N?");
		String nx="Y";
	    Scanner nx1=new Scanner(System.in);
	    String k = nx1.nextLine();
	    
	    
		if(k.equals(nx))
		{
			student.show();	
			student.deal(); 
	    }
		else
		{
			System.out.println("感谢使用");
		} 				
	}
		
	public void deal() 
		{
		    int k;
		    Scanner dl=new Scanner(System.in);
		    k=dl.nextInt();
				
		    switch (k){
		    case 0:
			    student.StudentShow();
			    break;
		    case 1:
			    student.DeleteStudent();
			    break;
		    case 2:
			    student.PutStudent();
			    break;
		    }				
		}
}