1 Star 0 Fork 0

Zhou Shihui/LeetCode

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
794.有效的井字游戏.java 1.24 KB
一键复制 编辑 原始数据 按行查看 历史
Zhou Shihui 提交于 2022-02-21 11:14 +08:00 . init commit
/*
* @lc app=leetcode.cn id=794 lang=java
*
* [794] 有效的井字游戏
*/
// @lc code=start
class ValidTicTacToe {
public boolean validTicTacToe(String[] board) {
int x = 0, o = 0;
char[][] grid = new char[3][3];
for (int i = 0; i < 3; i++) {
grid[i] = board[i].toCharArray();
}
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
x = grid[i][j] == 'X' ? x + 1 : x;
o = grid[i][j] == 'O' ? o + 1 : o;
}
}
if (x != o && x != o + 1) {
return false;
} else if (isWin(grid, 'X') && x != o + 1) {
return false;
} else if (isWin(grid, 'O') && x != o) {
return false;
} else {
return true;
}
}
boolean isWin(char[][] grid, char player) {
for (int i = 0; i < 3; i++) {
if (player == grid[i][0] && player == grid[i][1] && player == grid[i][2]) {
return true;
}
if (player == grid[0][i] && player == grid[1][i] && player == grid[2][i]) {
return true;
}
}
if (player == grid[0][0] && player == grid[1][1] && player == grid[2][2]) {
return true;
}
if (player == grid[0][2] && player == grid[1][1] && player == grid[2][0]) {
return true;
}
return false;
}
}
// @lc code=end
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/ImCaO/LeetCode.git
git@gitee.com:ImCaO/LeetCode.git
ImCaO
LeetCode
LeetCode
master

搜索帮助