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 moves[i] = [rowi, coli] indicates that the ith move will be played on grid[rowi][coli]. 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

moves[i].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";
    }
};
相关推荐
ChillJavaGuy5 小时前
常见限流算法详解与对比
java·算法·限流算法
散1125 小时前
01数据结构-01背包问题
数据结构
sali-tec5 小时前
C# 基于halcon的视觉工作流-章34-环状测量
开发语言·图像处理·算法·计算机视觉·c#
消失的旧时光-19435 小时前
Kotlinx.serialization 使用讲解
android·数据结构·android jetpack
Gu_shiwww6 小时前
数据结构8——双向链表
c语言·数据结构·python·链表·小白初步
你怎么知道我是队长6 小时前
C语言---循环结构
c语言·开发语言·算法
艾醒6 小时前
大模型面试题剖析:RAG中的文本分割策略
人工智能·算法
老赵的博客6 小时前
c++ unqiue指针
java·jvm·c++
苏小瀚7 小时前
[数据结构] 排序
数据结构
程序猿编码7 小时前
基于 Linux 内核模块的字符设备 FIFO 驱动设计与实现解析(C/C++代码实现)
linux·c语言·c++·内核模块·fifo·字符设备