-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathSolution.java
88 lines (72 loc) · 2.01 KB
/
Solution.java
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
/**
* Runtime: 14 ms, faster than 14.01% of Java online submissions for Design Tic-Tac-Toe.
* Memory Usage: 41.8 MB, less than 100.00% of Java online submissions for Design Tic-Tac-Toe.
*/
class TicTacToe {
char[][] board;
/** Initialize your data structure here. */
public TicTacToe(int n) {
board = new char[n][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) {
char c;
if (player == 1)
c = 'X';
else
c = 'O';
board[row][col] = c;
if (checkforWinner(row, col, player, board.length))
return player;
else
return 0;
}
private boolean checkforWinner(int row, int col, int player, int n) {
char c;
if (player == 1)
c = 'X';
else
c = 'O';
boolean flag = true;
for (int i = 0; i < n; i++) {
if (board[row][i] != c)
flag = false;
}
if (flag)
return flag;
flag = true;
for (int i = 0; i < n; i++) {
if (board[i][col] != c)
flag = false;
}
if (flag)
return flag;
flag = true;
for (int i = 0; i < n; i++) {
if (board[i][i] != c)
flag = false;
}
if (flag)
return flag;
flag = true;
for (int i = 0; i<n; i++) {
if (board[i][n-i-1] != c)
flag = false;
}
if (flag)
return flag;
return false;
}
}
/**
* Your TicTacToe object will be instantiated and called as such:
* TicTacToe obj = new TicTacToe(n);
* int param_1 = obj.move(row,col,player);
*/