leetcode 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?

Hint里给的提示已经比较明显了，创建一个行数组一个列数组，一个对角线变量，一个反对角线变量，每次若是玩家1操作则计数器加一，若玩家2则计数器减一，当计数器为n或-n时操作玩家取得胜利，代码：

private int[] rows;
private int[] cols;
private int n;
private int diag=0;
private int antidiag=0;
public TicTacToe(int n) {
    rows=new int[n];
    cols=new int[n];
    this.n=n;
}

public int move(int row, int col, int player) {
      int add=player==1?1:-1;
      rows[row]+=add;
      cols[col]+=add;
    if(row==col) diag+=add;
    if(row+col==n-1) antidiag+=add;
    return (Math.abs(rows[row])==n||Math.abs(cols[col])==n||Math.abs(diag)==n||Math.abs(antidiag)==n)?player:0;
}