- 有bug——可以在同一位置下棋子
- 有bug——输入的可以不是0或1
- 可以用算法优化——不一定需要下完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");
}
}
}