LeetCode #348 - Design Tic-Tac-Toe

题目描述：

Design a Tic-tac-toe game that is played between two players on a n x n grid.

You may assume the following rules:

1. A move is guaranteed to be valid and is placed on an empty block.

2. Once a winning condition is reached, no more moves is allowed.

3. A player who succeeds in placing n of their marks in a horizontal, vertical, or diagonal row wins the game.

Follow up: Could you do better than O(n^2) per move() operation?

class TicTacToe {
public:
    /** Initialize your data structure here. */
    TicTacToe(int n) {
        vector<int> temp(n,0);
        c=temp;
        r=temp;
    }
    
    /** Player {player} makes a move at ({row}, {col}).
        @param row The row of the board.
        @param col The column of the board.
        @param player The player, can be either 1 or 2.
        @return The current winning condition, can be either:
                0: No one wins.
                1: Player 1 wins.
                2: Player 2 wins. */
    int move(int row, int col, int player) {
        int n=c.size();
        if(player==1)
        {
            r[row]++;
            c[col]++;
            if(row==col) d1++;
            if(row+col==n-1) d2++;
            if(r[row]==n||c[col]==n||d1==n||d2==n) return 1;
        }
        else if(player==2)
        {
            r[row]--;
            c[col]--;
            if(row==col) d1--;
            if(row+col==n-1) d2--;
            if(r[row]==-n||c[col]==-n||d1==-n||d2==-n) return 2;
        }
        return 0;
    }
    
private:
    vector<int> c; // 记录每行上有多少个棋子，1表示player1，-1表示player2
    vector<int> r; // 记录每列上有多少个棋子，1表示player1，-1表示player2
    int d1=0; // 记录正对角线上有多少个棋子，1表示player1，-1表示player2
    int d2=0; // 记录逆对角线上有多少个棋子，1表示player1，-1表示player2
};

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