力扣：794. 有效的井字游戏

最新推荐文章于 2025-12-03 23:35:37 发布

原创最新推荐文章于 2025-12-03 23:35:37 发布 · 526 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #游戏 #java

算法同时被 2 个专栏收录

278 篇文章

订阅专栏

菜鸟刷题记录

204 篇文章

订阅专栏

本文探讨了如何用Java实现Tic Tac Toe游戏的解决方案，涉及游戏板状态检查、X和O计数以及判断胜负条件。重点在于算法逻辑和游戏规则的实现细节。

模拟题，不想写，CV一下，


/**
 * @author xnl
 * @Description:
 * @date: 2022/7/13   22:11
 */
public class Solution {
    public static void main(String[] args) {
        Solution solution = new Solution();

    }

    public boolean validTicTacToe(String[] board) {
        int xCount = 0 , yCount = 0;
        for (String row : board) {
            for (char c : row.toCharArray()) {
                xCount = (c == 'X') ? xCount + 1 : xCount;
                yCount = (c == 'O') ? yCount + 1 : yCount;
            }
        }
        return !((yCount != xCount && yCount != xCount - 1) ||
                (yCount != xCount - 1 && win(board, 'X')) ||
                (yCount != xCount && win(board, 'O')));
    }

    public boolean win(String[] board, char p){
        for (int i = 0; i < 3; i++){
            if (((p == board[0].charAt(i)) && (p == board[1].charAt(i)) && (p == board[2].charAt(i))) ||
                    (p == board[i].charAt(0) && p == board[i].charAt(1) && p == board[i].charAt(2))){
                return true;
            }
        }
        return (p == board[0].charAt(0) && p == board[1].charAt(1) && p == board[2].charAt(2)) ||
                (p == board[0].charAt(2) && p == board[1].charAt(1) && p == board[2].charAt(0));
    }
}