迷宫
public class MiGong {
public static void main(String[] args) throws InterruptedException {
int[][] map = new int[8][7];
for (int i=0;i<7;i++){
map[0][i] = 1;
map[7][i] = 1;
map[i][0] = 1;
map[i][6] = 1;
}
map[3][1] = 1;
map[3][2] = 1;
map[3][3] = 1;
//輸出地圖
for (int i=0;i<map.length;i++){
for (int j=0;j<map[i].length;j++){
System.out.print(map[i][j]+" ");
}
System.out.println();
}
T t = new T();
t.findWay(map,1,1,0);
}
}
class T{
public void print(int[][]map){
System.out.println("=============");
for (int i=0;i<map.length;i++){
for (int j=0;j<map[i].length;j++){
System.out.print(map[i][j]+" ");
}
System.out.println();
}
}
public boolean findWay(int[][] map,int i,int j,int count) throws InterruptedException {
print(map);
count++;
Thread.sleep(1000);
if (map[6][1] == 2){
System.out.println(count);
return true;
}else{
if (map[i][j] == 0){
map[i][j] = 2;
if (findWay(map,i+1,j,count)){//向下走
return true;
}else if (findWay(map,i,j+1,count)){//右邊
return true;
}else if(findWay(map,i-1,j,count)){//上邊
return true;
}else if (findWay(map,i,j-1,count)){//左邊
return true;
}else{
map[i][j]=3;
return false;
}
}else{
return false;
}
}
}
}
石头剪刀布
public class Test {
public static void main(String[] args) {
WanJia wo = new WanJia();
WanJia computer = new WanJia();
while (true){
System.out.println("请输入你的选择: 0--石头 1--剪刀 2--布");
began(wo,computer);
System.out.println("获胜次数:"+wo.winCount);
System.out.println("失败次数:"+wo.loseCount);
}
}
private static void began(WanJia wo, WanJia computer) {
computer.number= (int) (Math.random()*10)%3;
Scanner input = new Scanner(System.in);
wo.number= input.nextInt();
switch (wo.number){
case 0:{
System.out.println("你-->石头");
if (computer.number==0){
System.out.println("电脑-->石头");
System.out.println("平局");
}
if (computer.number==1){
System.out.println("电脑-->剪刀");
wo.winCount++;
System.out.println("获胜!");
}
if (computer.number==2){
System.out.println("电脑-->布");
wo.loseCount++;
System.out.println("失败");
}
break;
}case 1:{
System.out.println("你-->剪刀");
if (computer.number==0){
System.out.println("电脑-->石头");
wo.loseCount++;
System.out.println("失败");
}
if (computer.number==1){
System.out.println("电脑-->剪刀");
System.out.println("平局");
}
if (computer.number==2){
System.out.println("电脑-->布");
wo.winCount++;
System.out.println("获胜!");
}
break;
}case 2:{
System.out.println("你-->布");if (computer.number==0){
System.out.println("电脑-->石头");
wo.winCount++;
System.out.println("获胜!");
}
if (computer.number==1){
System.out.println("电脑-->剪刀");
wo.loseCount++;
System.out.println("失败");
}
if (computer.number==2){
System.out.println("电脑-->布");
System.out.println("平局");
}
break;
}default:{
System.out.println("输入有误");
break;
}
}
}
}
class WanJia{
int number;
int winCount=0;
int loseCount=0;
}
本文章使用limfx的vscode插件快速发布