forked from varunu28/LeetCode-Java-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDesign Tic-Tac-Toe.java
More file actions
52 lines (48 loc) · 1.39 KB
/
Design Tic-Tac-Toe.java
File metadata and controls
52 lines (48 loc) · 1.39 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
42
43
44
45
46
47
48
49
50
51
52
class TicTacToe {
/** Initialize your data structure here. */
private int[] rows;
private int[] cols;
private int leftDiagCount;
private int rightDiagCount;
private int n;
public TicTacToe(int n) {
this.n = n;
this.rows = new int[n];
this.cols = new int[n];
leftDiagCount = 0;
rightDiagCount = 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 moveValue = player == 1 ? 1 : -1;
rows[row] += moveValue;
cols[col] += moveValue;
if (row == col) {
leftDiagCount += moveValue;
}
if (col == n - row - 1) {
rightDiagCount += moveValue;
}
if (
Math.abs(rows[row]) == n ||
Math.abs(cols[col]) == n ||
Math.abs(leftDiagCount) == n ||
Math.abs(rightDiagCount) == 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);
*/