public class Solution extends Object
794 - Valid Tic-Tac-Toe State.
Medium
Given a Tic-Tac-Toe board 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 that consists of characters ' ', 'X', and 'O'. The ' ' character represents an empty square.
Here are the rules of Tic-Tac-Toe:
' '.'X' characters, while the second player always places 'O' characters.'X' and 'O' characters are always placed into empty squares, never filled ones.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 = [“XOX”,“O O”,“XOX”]
Output: true
Constraints:
board.length == 3board[i].length == 3board[i][j] is either 'X', 'O', or ' '.| Constructor and Description |
|---|
Solution() |
public boolean validTicTacToe(String[] board)
Copyright © 2022. All rights reserved.