Class Solution
-
- All Implemented Interfaces:
public final class Solution1275 - Find Winner on a Tic Tac Toe Game.
Easy
Tic-tac-toe is played by two players
AandBon a3 x 3grid. The rules of Tic-Tac-Toe are:Players take turns placing characters into empty squares
' '.The first player
Aalways places'X'characters, while the second playerBalways places'O'characters.'X'and'O'characters are always placed into empty squares, never on filled ones.The game ends when there are three 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.
Given a 2D integer array
moveswhere <code>movesi = row<sub>i</sub>, col<sub>i</sub></code> indicates that the <code>i<sup>th</sup></code> move will be played on <code>gridcol<sub>i</sub></code>. return the winner of the game if it exists (AorB). In case the game ends in a draw return"Draw". If there are still movements to play return"Pending".You can assume that
movesis valid (i.e., it follows the rules of Tic-Tac-Toe ), the grid is initially empty, andAwill play first.Example 1:
Input: moves = [0,0,2,0,1,1,2,1,2,2]
Output: "A"
Explanation: A wins, they always play first.
Example 2:
Input: moves = [0,0,1,1,0,1,0,2,1,0,2,0]
Output: "B"
Explanation: B wins.
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.
Constraints:
1 <= moves.length <= 9moves[i].length == 2<code>0 <= row<sub>i</sub>, col<sub>i</sub><= 2</code>
There are no repeated elements on
moves.movesfollow the rules of tic tac toe.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-