java初学(七)井字棋

  1. 有bug——可以在同一位置下棋子
  2. 有bug——输入的可以不是0或1
  3. 可以用算法优化——不一定需要下完9颗棋子才能够判断输赢
package cn;

import java.util.Arrays;
import java.util.Scanner;

public class Chess {
    public static boolean check(int board[][],int player) {
        for (int i = 0; i < 3; i++) {
            //检查行 列 对角线
            if ((board[i][0] == player && board[i][1] == player && board[i][2] == player) || (board[0][i] == player && board[1][i] == player && board[2][i] == player) || (board[0][0] == player && board[1][1] == player && board[2][2] == player) || (board[0][2] == player && board[1][1] == player && board[2][0] == player)) {
                return true;
            }
        }
        return false;
    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[][] board = {
                {-1, -1, -1},
                {-1, -1, -1},
                {-1, -1, -1}
        };
        int round = 0;//下的次数 最大只能是九次
        int x, y;
        boolean player1Win = false;
        boolean player2Win = false;
        for (int[] ints : board) {
            System.out.println(Arrays.toString(ints));
        }
        while (!player1Win && !player2Win && round != 9) {
            System.out.println("请输入玩家一(0)要下的位置");
            x = sc.nextInt();
            y = sc.nextInt();
            board[x][y] = 0;
            round++;
            player1Win = check(board, 0);
            if (!player1Win && round != 9) {
                System.out.println("请输入玩家二(1)要下的位置");
                x = sc.nextInt();
                y = sc.nextInt();
                board[x][y] = 1;
                round++;
                player2Win = check(board, 1);
            }
            for (int[] ints : board) {
                System.out.println(Arrays.toString(ints));
            }
        }
        if (player1Win) {
            System.out.println("Player1 is winner");
        } else if (player2Win) {
            System.out.println("Player2 is winner");
        } else {
            System.out.println("Player1 draws with Player2");
        }
    }
}

 

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值