Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
88 lines (85 loc) · 3.08 KB

File metadata and controls

88 lines (85 loc) · 3.08 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package array;
/**
* Created by gouthamvidyapradhan on 29/03/2019
* A Tic-Tac-Toe board is given as a string array board. Return True if and only if it is possible to reach this
* board position during the course of a valid tic-tac-toe game.
*
* The board is a 3 x 3 array, and consists of characters " ", "X", and "O". The " " character represents an empty
* square.
*
* Here are the rules of Tic-Tac-Toe:
*
* Players take turns placing characters into empty squares (" ").
* The first player always places "X" characters, while the second player always places "O" characters.
* "X" and "O" characters are always placed into empty squares, never filled ones.
* The game ends when there are 3 of the same (non-empty) character filling any row, column, or diagonal.
* The game also ends if all squares are non-empty.
* No more moves can be played if the game is over.
* Example 1:
* Input: board = ["O ", " ", " "]
* Output: false
* Explanation: The first player always plays "X".
*
* Example 2:
* Input: board = ["XOX", " X ", " "]
* Output: false
* Explanation: Players take turns making moves.
*
* Example 3:
* Input: board = ["XXX", " ", "OOO"]
* Output: false
*
* Example 4:
* Input: board = ["XOX", "O O", "XOX"]
* Output: true
* Note:
*
* board is a length-3 array of strings, where each string board[i] has length 3.
* Each board[i][j] is a character in the set {" ", "X", "O"}.
*
* Solution: Do a brute-force check for each row, column and diagonals and keep track of count of 'X' and 'O'
*/
public class ValidTicTacToeState {
/**
* Main method
* @param args
*/
public static void main(String[] args) {
String[] board = {"XXX", "XOO", "OO "};
System.out.println(new ValidTicTacToeState().validTicTacToe(board));
}
public boolean validTicTacToe(String[] board) {
boolean xWon = hasWon(board, 'X');
boolean oWon = hasWon(board, 'O');
int xcount = 0, ocount = 0;
for(int i = 0; i < 3; i ++){
for(int j = 0; j < 3; j ++){
if(board[i].charAt(j) == 'X'){
xcount++;
}else if(board[i].charAt(j) == 'O'){
ocount++;
}
}
}
if(xWon && oWon) return false;
if(xWon){
return ((xcount - 1 == ocount));
} else if(oWon){
return ((xcount == ocount));
} else {
return (xcount == ocount || xcount - 1 == ocount);
}
}
private boolean hasWon(String[] board, char c){
boolean diagnol = ((board[0].charAt(0) == c && board[1].charAt(1) == c && board[2].charAt(2) == c) ||
(board[0].charAt(2) == c && board[1].charAt(1) == c && board[2].charAt(0) == c));
if(diagnol) return true;
for(int i = 0; i < 3; i ++){
if(board[i].charAt(0) == c && board[i].charAt(1) == c && board[i].charAt(2) == c) return true;
}
for(int i = 0; i < 3; i ++){
if(board[0].charAt(i) == c && board[1].charAt(i) == c && board[2].charAt(i) == c) return true;
}
return false;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.