Question
Design a Tic-tac-toe game that is played between two players on a n x n grid.
You may assume the following rules:
- A move is guaranteed to be valid and is placed on an empty block.
- Once a winning condition is reached, no more moves is allowed.
- 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:
- Could you trade extra space such that
move()operation can be done in O(1)? - You need two arrays: int rows[n], int cols[n], plus two variables: diagonal, anti_diagonal.
Answer
对于move操作，简单粗暴的方法是遍历整个二维数组，对每一行每一列以及对角线检查。时间，空间复杂度均为O(n^2)
我们可以单独考虑行，列，对角。
对于一行row[i]，如果这一行中有棋手1下过，则+1。如果有棋手2下过，则-1。所以如果这一行全为棋手1下的，row[i]=n。棋手1获胜。
Similar case for col and diagonal, anti diagonal。
Time complexity O(1) Space complexity O(n)
public class TicTacToe {
private int[] row;
private int[] col;
private int diagonal;
private int anti_diagonal;
private int size;
/** Initialize your data structure here. */
public TicTacToe(int n) {
size = n;
row = new int[n];
col = new int[n];
Arrays.fill(row, 0);
Arrays.fill(col, 0);
diagonal = 0;
anti_diagonal = 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 change = player == 1 ? 1 : -1;
this.row[row] += change;
this.col[col] += change;
if (row == col) {
diagonal += change;
}
if (row == (size - col - 1)) {
anti_diagonal += change;
}
if (this.row[row] == size || this.col[col] == size || diagonal == size || anti_diagonal == size) {
return 1;
}
if (this.row[row] == -size || this.col[col] == -size || diagonal == -size || anti_diagonal == -size) {
return 2;
}
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);
*/