Tic-Tac-Toe Winner

A 3×3 board is given as three strings of X, O and . (empty). A player wins with three of their marks in a row, column or diagonal. Boards never have two winners.

Implement tic_tac_toe_winner(board).

Input

board: Three rows of three characters each.

Output

Return "X" or "O" for the winner, "Draw" if the board is full with no winner, or "Pending" if empty cells remain and nobody has won.

Contraintes

board has exactly 3 rows of length 3

Exemples

Entrée :
board = ["XOX", ".X.", "O.X"]

Sortie attendue :
expected = "X"

Entrée :
std::vector<std::string> board = {"XOX", ".X.", "O.X"};

Sortie attendue :
std::string expected = "X";

Entrée :
string[] board = new string[] {"XOX", ".X.", "O.X"};

Sortie attendue :
string expected = "X";

Entrée :
board = ["XOX", "XOO", "OXX"]

Sortie attendue :
expected = "Draw"

Entrée :
std::vector<std::string> board = {"XOX", "XOO", "OXX"};

Sortie attendue :
std::string expected = "Draw";

Entrée :
string[] board = new string[] {"XOX", "XOO", "OXX"};

Sortie attendue :
string expected = "Draw";

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• GWU CS1111 Introduction to Software Development - lab sequence