Skip to content

Latest commit

 

History

History
99 lines (47 loc) · 2.38 KB

File metadata and controls

99 lines (47 loc) · 2.38 KB

中文文档

Description

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:

    <li>Players take turns placing characters into empty squares (&quot; &quot;).</li>
    
    <li>The first player always places &quot;X&quot; characters, while the second player always places &quot;O&quot; characters.</li>
    
    <li>&quot;X&quot; and &quot;O&quot; characters are always placed into empty squares, never filled ones.</li>
    
    <li>The game ends when there are 3 of the same (non-empty) character filling any row, column, or diagonal.</li>
    
    <li>The game also ends if all squares are non-empty.</li>
    
    <li>No more moves can be played if the game is over.</li>
    
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:

    <li><code>board</code> is a length-3 array of strings, where each string <code>board[i]</code> has length 3.</li>
    
    <li>Each <code>board[i][j]</code> is a character in the set <code>{&quot; &quot;, &quot;X&quot;, &quot;O&quot;}</code>.</li>
    

Solutions

Python3

Java

...