Skip to content

Commit ec7b616

Browse files
author
C5141506
committed
add tic tac tao leetcode problem
1 parent 9371877 commit ec7b616

File tree

7 files changed

+66
-6
lines changed

7 files changed

+66
-6
lines changed

src/main/problems/java/DecodeTheMessage.java renamed to src/main/problems/java_problem/DecodeTheMessage.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package java;
1+
package java_problem;
22

33
import java.util.HashMap;
44

src/main/problems/java/Palindrome.java renamed to src/main/problems/java_problem/Palindrome.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package java;
1+
package java_problem;
22

33
public class Palindrome {
44
public static void main(String args[]) {

src/main/problems/java/PangramSentence.java renamed to src/main/problems/java_problem/PangramSentence.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package java;
1+
package java_problem;
22

33
import java.util.ArrayList;
44

Lines changed: 60 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,60 @@
1+
package java_problem;
2+
3+
public class TicTacTao {
4+
public static void main(String[] args) {
5+
int[][] moves = new int[][]{{0, 0}, {2, 0}, {1, 1}, {2, 1}, {2, 2}};
6+
System.out.println(ticTacToe(moves));
7+
}
8+
9+
public static String ticTacToe(int[][] moves) {
10+
char board[][] = new char[3][3];
11+
for (int row = 0; row < 3; row++) {
12+
for (int col = 0; col < 3; col++) {
13+
board[row][col] = 'N';
14+
}
15+
}
16+
int i = 0;
17+
for (int[] arr : moves) {
18+
if (i % 2 == 0) {
19+
board[arr[0]][arr[1]] = 'X';
20+
} else {
21+
board[arr[0]][arr[1]] = 'O';
22+
}
23+
i++;
24+
}
25+
26+
//checking winner from rows and columns
27+
for (i = 0; i < 3; i++) {
28+
if (board[i][0] == board[i][1] && board[i][1] == board[i][2])
29+
if (board[i][0] == 'X')
30+
return "A";
31+
else if (board[i][0] == 'O')
32+
return "B";
33+
if (board[0][i] == board[1][i] && board[1][i] == board[2][i])
34+
if (board[0][i] == 'X')
35+
return "A";
36+
else if (board[0][i] == 'O')
37+
return "B";
38+
39+
}
40+
//checking winner from main diagonal
41+
if (board[0][0] == board[1][1] && board[1][1] == board[2][2])
42+
if (board[0][0] == 'X')
43+
return "A";
44+
else if (board[0][0] == 'O')
45+
return "B";
46+
47+
//checking winner from right diagonal
48+
if (board[2][0] == board[1][1] && board[1][1] == board[0][2])
49+
if (board[2][0] == 'X')
50+
return "A";
51+
else if (board[2][0] == 'O')
52+
return "B";
53+
54+
if (moves.length < 9)
55+
return "Pending";
56+
57+
return "Draw";
58+
}
59+
}
60+

src/main/problems/kotlin/DecodeTheMessageKotlin.kt renamed to src/main/problems/kotlin_problem/DecodeTheMessageKotlin.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package kotlin
1+
package kotlin_problem
22

33
import java.util.HashMap
44

src/main/problems/kotlin/Main.kt renamed to src/main/problems/kotlin_problem/Main.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package kotlin
1+
package kotlin_problem
22

33
fun main(args: Array<String>) {
44
println("Hello World!")

src/main/problems/kotlin/ReverseArrayIndexValue.kt renamed to src/main/problems/kotlin_problem/ReverseArrayIndexValue.kt

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
package kotlin
1+
package kotlin_problem
22

33
object ReverseArrayIndexValue {
44
@JvmStatic

0 commit comments

Comments
 (0)