forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_1275.java
64 lines (59 loc) · 1.94 KB
/
_1275.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
package com.fishercoder.solutions;
public class _1275 {
public static class Solution1 {
public String tictactoe(int[][] moves) {
String[][] board = new String[3][3];
for (int i = 0; i < moves.length; i++) {
if (i % 2 == 0) {
board[moves[i][0]][moves[i][1]] = "X";
} else {
board[moves[i][0]][moves[i][1]] = "O";
}
if (i > 3) {
if (!wins(board).equals("")) {
return wins(board);
}
}
}
return moves.length == 9 ? "Draw" : "Pending";
}
private String wins(String[][] board) {
//check rows
for (int i = 0; i < 3; i++) {
if (board[i][0] == null) {
break;
}
String str = board[i][0];
if (str.equals(board[i][1]) && str.equals(board[i][2])) {
return getWinner(str);
}
}
//check columns
for (int j = 0; j < 3; j++) {
if (board[0][j] == null) {
break;
}
String str = board[0][j];
if (str.equals(board[1][j]) && str.equals(board[2][j])) {
return getWinner(str);
}
}
//check diagonals
if (board[1][1] == null) {
return "";
}
String str = board[1][1];
if (str.equals(board[0][0]) && str.equals(board[2][2]) || (str.equals(board[0][2]) && str.equals(board[2][0]))) {
return getWinner(str);
}
return "";
}
private String getWinner(String str) {
if (str.equals("X")) {
return "A";
} else {
return "B";
}
}
}
}