练习002 五子棋

练习002 五子棋

自己练

package cat3;

import java.util.Scanner;

public class Demo08 {
    public static void main(String[] args) {
        int[][] chess = new int[10][10];
        Scanner scanner = new Scanner(System.in);
        int row = 0;
        int col = 0;
        boolean flag = false;
        int player = 1;
        boolean winner = false;

        for (int i = 0; i < 100; i++) {
            // 定位落子:
            System.out.println("请输入一个0~99的正整数:");
            if (scanner.hasNextInt()) {
                int a = scanner.nextInt();

                if (a < 0 || a >= 100) {
                    System.out.println("数据超出范围!");
                    i--;
                    flag = true;
                } else {
                    col = a % 10;
                    row = (a - col) / 10;
                }
            } else {
                System.out.println("输入的不是整数!");
                break;
            }

            if (!flag) {
                // 落子:
                if (chess[row][col] != 0) {
                    System.out.println("无法重复落子!");
                    i--;
                    player = 3 - player;
                } else {
                    chess[row][col] = player;
                }

                // 输出落子后结果:
                for (int[] ints : chess) {
                    for (int anInt : ints) {
                        System.out.print(anInt + "\t");
                    }
                    System.out.println();
                }
            }

            // 判断获胜条件:
            for (int k = 0; k < 10; k++) {
                for (int j = 0; j <= 5; j++) {
                    if(chess[k][j] == player
                       && chess[k][j+1] == player
                       && chess[k][j+2] == player
                       && chess[k][j+3] == player
                       && chess[k][j+4] == player){
                        System.out.println("player"+player+" win!");
                        winner = true;
                    }
                    if(chess[j][k] == player
                       && chess[j+1][k] == player
                       && chess[j+2][k] == player
                       && chess[j+3][k] == player
                       && chess[j+4][k] == player){
                        System.out.println("player"+player+" win!");
                        winner = true;
                    }
                }
            }
            for (int n = 0; n < 6; n++) {
                for (int m = 0; m < 6; m++) {
                    if(chess[n][m] == player
                       && chess[n+1][m+1] == player
                       && chess[n+2][m+2] == player
                       && chess[n+3][m+3] == player
                       && chess[n+4][m+4] == player){
                        System.out.println("player"+player+" win!");
                        winner = true;
                    }
                }
            }

            if(winner){
                break;
            }

            flag = false; // 重置。
            player = 3 - player; // 切换玩家。
        }
    }
}

较好方法

暂无。

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值