游戏菜单级联
来源:互联网 发布:dijkstra算法求解过程 编辑:程序博客网 时间:2024/06/05 03:33
package test;import java.util.Scanner;public class jjj {String name;int score;public int show(){Scanner input=new Scanner(System.in);System.out.println("选择出拳类型:1.剪刀,2.石头,3.布");int num=input.nextInt();switch(num){case 1: System.out.println(name+"剪刀");break;case 2:System.out.println(name+"石头");break;case 3:System.out.println(name+"布");break;}return num;}}
package test;public class newmain { String name;int score;public int show(){int s=(int)(Math.random()*3)+1;if(s==1){System.out.println(name+"剪刀");}else if(s==2){System.out.println(name+"石头");}else if(s==3){System.out.println(name+"布");}return s;}}
package test;import java.util.Scanner;public class Games {jjj jia;newmain yi;int count;public void initial(){jia=new jjj();yi=new newmain();}public void qidong(){initial();Scanner input=new Scanner(System.in);System.out.println("*\t*\t*游戏世界\t*\t*\t*\t");System.out.println("*\t*\t*\t*\t*\t*");System.out.println("*\t*\t*猜拳,开始*\t*\t*");System.out.println("*\t*\t*\t*\t*\t*");System.out.println("开始游戏,请选择人物");System.out.println("1.刘备2.曹操3.孙权");int s=input.nextInt();switch(s){case 1:yi.name="刘备";break;case 2:yi.name="曹操";break;case 3:yi.name="孙权";break;}System.out.println("您选择与"+yi.name+"对战");System.out.println("输入玩家姓名:");jia.name=input.next();System.out.println("是否开始?(y/n)");String start=input.next();while("y".equals(start)){count++;int yh=jia.show();int dn=yi.show();System.out.println(yh+" "+dn);if((yh==1&&dn==1)|| (yh==2&&dn==2)|| (yh==3&&dn==3)){System.out.println("平局");}else if((yh==1&&dn==3)||(yh==2&&dn==1)||(yh==3&&dn==2)){System.out.println("恭喜,你赢了");jia.score++;}else{System.out.println("sorry,你输了");yi.score++;}System.out.println("是否开始?(y/n)"); start=input.next();}duizhan();}public void duizhan(){System.out.println("_________________________________");System.out.println(jia.name+" VS "+yi.name);System.out.println("对战次数:"+count);System.out.println("胜负次数:");System.out.println(jia.score+" VS "+yi.score);if(jia.score>yi.score){System.out.println("电脑赢");}else if(jia.score<yi.score){System.out.println("玩家赢");}else{System.out.println("平局");}}}
package test;public class sss {public static void main(String[] args) {Games sjq=new Games();sjq.qidong();}}
0 0
- 游戏菜单级联
- 游戏菜单级联
- 游戏菜单级联
- 级联菜单
- 级联菜单
- 级联菜单
- 级联菜单
- 级联菜单
- 菜单级联
- 菜单级联
- 级联菜单
- 级联菜单
- 级联菜单
- 级联菜单
- 级联菜单
- 级联菜单
- 级联菜单,省市级联菜单
- 级联菜单,两级菜单
- MBProgressHUD
- Python数字图像处理
- 后缀表达式计算——栈的应用
- 第一行代码系列第二章——向下一个活动传递数据
- Mysql Innodb锁分析
- 游戏菜单级联
- 线性代数复习 第六章 二次型
- 1117. Eddington Number(25)-PAT甲级真题
- *[Lintcode] Decode Ways
- VPS主机IP被墙怎么办 导致IP被墙的原因
- 244.1
- 基于tmpfs使用mongoDB
- maven的pom文件报错: must be "pom" but is "jar"
- 【web】basic HTML(1)