README_EN.md

1275. Find Winner on a Tic Tac Toe Game

中文文档

Description

Tic-tac-toe is played by two players A and B on a 3 x 3 grid.

Here are the rules of Tic-Tac-Toe:

<li>Players take turns placing characters into empty squares (&quot; &quot;).</li>

<li>The first player <em>A</em> always places &quot;X&quot; characters, while the second player <em>B</em>&nbsp;always places &quot;O&quot; characters.</li>

<li>&quot;X&quot; and &quot;O&quot; characters are always placed into empty squares, never on 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>

Given an array moves where each element is another array of size 2 corresponding to the row and column of the grid where they mark their respective character in the order in which A and B play.

Return the winner of the game if it exists (A or B), in case the game ends in a draw return "Draw", if there are still movements to play return "Pending".

You can assume that moves is valid (It follows the rules of Tic-Tac-Toe), the grid is initially empty and A will play first.

 

Example 1:

Input: moves = [[0,0],[2,0],[1,1],[2,1],[2,2]]

Output: "A"

Explanation: "A" wins, he always plays first.

"X  "    "X  "    "X  "    "X  "    "X  "

"   " -> "   " -> " X " -> " X " -> " X "

"   "    "O  "    "O  "    "OO "    "OOX"

Example 2:

Input: moves = [[0,0],[1,1],[0,1],[0,2],[1,0],[2,0]]

Output: "B"

Explanation: "B" wins.

"X  "    "X  "    "XX "    "XXO"    "XXO"    "XXO"

"   " -> " O " -> " O " -> " O " -> "XO " -> "XO " 

"   "    "   "    "   "    "   "    "   "    "O  "

Example 3:

Input: moves = [[0,0],[1,1],[2,0],[1,0],[1,2],[2,1],[0,1],[0,2],[2,2]]

Output: "Draw"

Explanation: The game ends in a draw since there are no moves to make.

"XXO"

"OOX"

"XOX"

Example 4:

Input: moves = [[0,0],[1,1]]

Output: "Pending"

Explanation: The game has not finished yet.

"X  "

" O "

"   "

 

Constraints:

<li><code>1 &lt;= moves.length &lt;= 9</code></li>

<li><code>moves[i].length == 2</code></li>

<li><code>0 &lt;= moves[i][j] &lt;= 2</code></li>

<li>There are no repeated elements on <code>moves</code>.</li>

<li><code>moves</code> follow the rules of tic tac toe.</li>

Solutions

Python3

Java

...