-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path348. Design Tic-Tac-Toe
More file actions
41 lines (37 loc) · 1.22 KB
/
348. Design Tic-Tac-Toe
File metadata and controls
41 lines (37 loc) · 1.22 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
class TicTacToe {
/** Initialize your data structure here. */
int[][] grid;
int n;
int[] rows, cols;
int d1 = 0, d2 = 0;
public TicTacToe(int n) {
this.n = n;
grid = new int[n][n];
rows = new int[n];
cols = new int[n];
}
/** 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) {
grid[row][col] = player;
int add = player == 1 ? 1 : -1;
rows[row] += add;
cols[col] += add;
if(row == col) d1 += add;
if(row + col == n - 1) d2 += add;
if(rows[row] == n || cols[col] == n || d1 == n || d2 == n) return player;
if(rows[row] == -n || cols[col] == -n || d1 == -n || d2 == -n) return player;
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);
*/