ICode9

精准搜索请尝试: 精确搜索
首页 > 数据库> 文章详细

[Oracle] LeetCode 348 Design Tic-Tac-Toe

2022-08-27 16:00:09  阅读:169  来源: 互联网

标签:int diag player vector Design Tac Oracle col row


Assume the following rules are for the tic-tac-toe game on an n x n board between two players:

  • A move is guaranteed to be valid and is placed on an empty block.
  • Once a winning condition is reached, no more moves are allowed.
  • A player who succeeds in placing n of their marks in a horizontal, vertical, or diagonal row wins the game.

Implement the TicTacToe class:

  • TicTacToe(int n) Initializes the object the size of the board n.
  • int move(int row, int col, int player) Indicates that the player with id player plays at the cell (row, col) of the board. The move is guaranteed to be a valid move.

Solution

按照正常思路,对每行,每列,对角线都 \(check\) 的话,每次都得 \(O(N)\). 但实际上我们只关心出现的次数是否为 \(n\) 即可,所以为每个 \(player\) 分别开个 \(vector\) 记录即可

点击查看代码
class TicTacToe {
private:
    vector<vector<int>> R, C;
    vector<int> diag, r_diag;
    
public:
    TicTacToe(int n) {
        R = vector<vector<int>> (n, vector<int>(3));
        C = vector<vector<int>> (n, vector<int>(3));
        diag = vector<int> (3);
        r_diag = vector<int> (3);
    }
    
    int move(int row, int col, int player) {
        int cnt;
        R[row][player]++; C[col][player]++;
        cnt = max(R[row][player], C[col][player]);
        if(row==col)diag[player]++;
        if(row+col==R.size()-1)r_diag[player]++;
        cnt=max(cnt, max(diag[player], r_diag[player]));
        if(cnt==R.size())return player;
        else return 0;
    }
};

/**
 * Your TicTacToe object will be instantiated and called as such:
 * TicTacToe* obj = new TicTacToe(n);
 * int param_1 = obj->move(row,col,player);
 */

标签:int,diag,player,vector,Design,Tac,Oracle,col,row
来源: https://www.cnblogs.com/xinyu04/p/16630755.html

本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有