LeetCode1275. Find Winner on a Tic Tac Toe Game

文章目录

一、题目

Tic-tac-toe is played by two players A and B on a 3 x 3 grid. The rules of Tic-Tac-Toe are:

Players take turns placing characters into empty squares ' '.

The first player A always places 'X' characters, while the second player B always places 'O' characters.

'X' and 'O' characters are always placed into empty squares, never on filled ones.

The game ends when there are three of the same (non-empty) character filling any row, column, or diagonal.

The game also ends if all squares are non-empty.

No more moves can be played if the game is over.

Given a 2D integer array moves where movesi = rowi, coli indicates that the ith move will be played on gridrowicoli. return the winner of the game if it exists (A or B). In case the game ends in a draw return "Draw". If there are still movements to play return "Pending".

You can assume that moves is valid (i.e., it follows the rules of Tic-Tac-Toe), the grid is initially empty, and A will play first.

Example 1:

Input: moves = \[0,0,2,0,1,1,2,1,2,2]

Output: "A"

Explanation: A wins, they always play first.

Example 2:

Input: moves = \[0,0,1,1,0,1,0,2,1,0,2,0]

Output: "B"

Explanation: B wins.

Example 3:

Input: moves = \[0,0,1,1,2,0,1,0,1,2,2,1,0,1,0,2,2,2]

Output: "Draw"

Explanation: The game ends in a draw since there are no moves to make.

Constraints:

1 <= moves.length <= 9

movesi.length == 2

0 <= rowi, coli <= 2

There are no repeated elements on moves.

moves follow the rules of tic tac toe.

二、题解

cpp 复制代码
class Solution {
public:
    string tictactoe(vector<vector<int>>& moves) {
        int n = moves.size();
        vector<vector<string>> grid(3,vector<string>(3," "));
        for(int i = 0;i < n;i++){
            if(i % 2 == 0) grid[moves[i][0]][moves[i][1]] = "X";
            else grid[moves[i][0]][moves[i][1]] = "O";
        }
        //判断行
        for(int i = 0;i < 3;i++){
            if(grid[i][0] != " " && grid[i][0] == grid[i][1] && grid[i][1] == grid[i][2]){
                if(grid[i][0] == "X") return "A";
                else return "B";
            }
        }
        //判断列
        for(int j = 0;j < 3;j++){
            if(grid[0][j] != " " && grid[0][j] == grid[1][j] && grid[1][j] == grid[2][j]){
                if(grid[0][j] == "X") return "A";
                else return "B";
            }
        }
        //判断主对角线
        if(grid[0][0] != " " && grid[0][0] == grid[1][1] && grid[1][1] == grid[2][2]){
            if(grid[0][0] == "X") return "A";
            else return "B";
        }
        //判断副对角线
        if(grid[0][2] != " " && grid[0][2] == grid[1][1] && grid[1][1] == grid[2][0]){
            if(grid[0][2] == "X") return "A";
            else return "B";
        }
        if(moves.size() < 9) return "Pending";
        else return "Draw";
    }
};
相关推荐
在所不辞兄2 小时前
为什么数字孪生驱动的产线标定需要在线更新机制,而不能一次标定后长期沿用?
人工智能·神经网络·其他·算法·机器学习
无忧.芙桃3 小时前
C++语言原理与实践(二十三):哈希表的实现
c++·链表·哈希算法·散列表·哈希表
郝学胜-神的一滴5 小时前
Effective Python 条款36:优雅拼装迭代器与生成器
开发语言·数据结构·人工智能·python·numpy·scikit-learn
文丑颜不良啊5 小时前
LeetCode3401~3420题目解析
java·leetcode
AvocadoZeroOneOI6 小时前
B4500 [GESP202603 三级] 凯撒密码 详细解题报告
c++·算法
文丑颜不良啊7 小时前
LeetCode3421~3440题目解析
java·leetcode
cjz38998 小时前
双指针技巧:覆盖式双指针(原地覆盖)
算法
whitelbwwww8 小时前
cuBLAS--CUDA高性能线性代数计算库--第一部分
c++·线性代数·gpu算力·cuda c++
console.log('npc')10 小时前
Python 学习教程 · 第4课:数据结构
数据结构·python·学习
eggwyw11 小时前
C++设计模式之解释器模式
开发语言·c++