Tic-tac-toe is played by two players
B on a
3 x 3 grid. The rules of Tic-Tac-Toe are:
- Players take turns placing characters into empty squares
- The first player
'X'characters, while the second player
'O'characters are always placed into empty squares, never on filled ones.
- The game ends when there are
threeof 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
moves where moves[i] = [rowi, coli] indicates that the ith move will be played on grid[rowi][coli]. return the winner of the game if it exists (
B). In case the game ends in a draw return
"Draw". If there are still movements to play return
You can assume that
moves is valid (i.e., it follows the rules of Tic-Tac-Toe), the grid is initially empty, and
A will play first.
x _ _ _ x _ o o x Input: moves = [[0,0],[2,0],[1,1],[2,1],[2,2]] Output: "A" Explanation: A wins, they always play first.
x x o x o _ o _ _ Input: moves = [[0,0],[1,1],[0,1],[0,2],[1,0],[2,0]] Output: "B" Explanation: B wins.
x x o o o x x o x 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.
- 1 <= moves.length <= 9
- moves[i].length == 2
- 0 <= rowi, coli <= 2
- There are no repeated elements on
movesfollow the rules of tic tac toe.