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.

Example:

Given n = 3, assume that player 1 is "X" and player 2 is "O" in the board.

TicTacToe toe = new TicTacToe(3);

toe.move(0, 0, 1); -> Returns 0 (no one wins)
|X| | |
| | | |    // Player 1 makes a move at (0, 0).
| | | |

toe.move(0, 2, 2); -> Returns 0 (no one wins)
|X| |O|
| | | |    // Player 2 makes a move at (0, 2).
| | | |

toe.move(2, 2, 1); -> Returns 0 (no one wins)
|X| |O|
| | | |    // Player 1 makes a move at (2, 2).
| | |X|

toe.move(1, 1, 2); -> Returns 0 (no one wins)
|X| |O|
| |O| |    // Player 2 makes a move at (1, 1).
| | |X|

toe.move(2, 0, 1); -> Returns 0 (no one wins)
|X| |O|
| |O| |    // Player 1 makes a move at (2, 0).
|X| |X|

toe.move(1, 0, 2); -> Returns 0 (no one wins)
|X| |O|
|O|O| |    // Player 2 makes a move at (1, 0).
|X| |X|

toe.move(2, 1, 1); -> Returns 1 (player 1 wins)
|X| |O|
|O|O| |    // Player 1 makes a move at (2, 1).
|X|X|X|

Follow up:
Could you do better than O(n2) per move() operation?

这道题想要我们用空间换时间。用两个数组，代表的是某一行，某一列的值, 另外需要一个对角线跟一个反对角线（不理解为什么要设置成n，感觉只有n =3的时候设计的游戏才合理..）。初始值都是0， 如果player1走到这一行这一列，那么+1 如果是playter2那么都-1。每次Move操作后，判断这个受影响的位置所在的行，列以及对角线，反对角线，这四个值是否达到了+n 或者-1则说明出来结果了。直接返回当前的player编号。

代码：

int size;
    int[] rows;
    int[] cols;
    int diag;
    int reverseDiag;
    /** Initialize your data structure here. */
    public TicTacToe(int n) {
        this.size = n;
        this.rows = new int[n];
        this.cols = new int[n];
        this.diag = 0;
        this.reverseDiag = 0;
    }

    /** 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. */
    public int move(int row, int col, int player) {
        int add = player==1?1:-1;
        rows[row] += add;
        cols[col] += add;
        diag += (row == col) ? add:0;
        reverseDiag += ((row+col) == size-1)?add:0;
        return getResult(row, col, player);
    }

    private int getResult(int row, int col, int player){
        if(Math.abs(rows[row]) == size || Math.abs(cols[col]) == size || Math.abs(diag) == size || Math.abs(reverseDiag) == size){
            return player;
        }else
            return 0;
    }