该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
select = input.nextInt();
switch(select){
case 1:
if(seqqueue.isEmpty()){
System.out.println("\t队为空!");
}else{
System.out.println("\t 队中有数据!");
}
break;
case 2:
System.out.print("\t 输入要进队的数据: ");
data=input.next();
seqqueue.enQueue(data);
System.out.print("\t 进队数据位:"+data+"\n");
break;
case 3:
System.out.println("\t 出队数据为 :"+seqqueue.deQueue());
break;
case 4:
System.out.println("\t队头为:" + seqqueue.value[seqqueue.front]);
break;
case 5:
System.out.println("\t 队头"+seqqueue.toString()+"队尾");
break;
case 6:
mainMenu();
break;
default:
continue;
}
} while(true);
}
public void linkqueueMenu(){
LinkQueuelinkqueue= new LinkQueue();
// seqQueueque= new SeqQueue(5);
int select;
do{
System.out.print("\n");
System.out.print("\n");
System.out.print("\t\t---- 队的链式存储结构的操作菜单 ----\n");
System.out.print("\n");
System.out.print("\t【1-判断队空】 【2-进队】\n");
System.out.print("\t【3-出队】 【4-显示队头数据】\n");
System.out.print("\t【5-显示队所有的数据】 \n");
System.out.print("\t【6-返回上一级菜单】\n");
System.out.print("\n\t 请选择:");
select = input.nextInt();
switch(select){
case 1:
if(linkqueue.isEmpty()){
System.out.println("\t队为空!");
}else{
System.out.println("\t 队中有数据!");
}
break;
case 2:
System.out.print("\t 输入要进队的数据: ");
data=input.next();
linkqueue.enQueue(data);
System.out.print("\t 进队数据位:"+data+"\n");
break;
case 3:
System.out.println("\t 出队数据为 :"+linkqueue.deQueue());
break;
case 4:
System.out.println("\t队头为:" + linkqueue.getFront());
break;
case 5:
System.out.println("\t 队头"+linkqueue.toString()+"队尾");
break;
case 6:
mainMenu();
break;
default:
continue;
}
} while(true);
}
}