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.

सीमाएँ

board has exactly 3 rows of length 3

उदाहरण

इनपुट:
board = ["XOX", ".X.", "O.X"]

अपेक्षित आउटपुट:
expected = "X"

इनपुट:
std::vector<std::string> board = {"XOX", ".X.", "O.X"};

अपेक्षित आउटपुट:
std::string expected = "X";

इनपुट:
string[] board = new string[] {"XOX", ".X.", "O.X"};

अपेक्षित आउटपुट:
string expected = "X";

इनपुट:
board = ["XOX", "XOO", "OXX"]

अपेक्षित आउटपुट:
expected = "Draw"

इनपुट:
std::vector<std::string> board = {"XOX", "XOO", "OXX"};

अपेक्षित आउटपुट:
std::string expected = "Draw";

इनपुट:
string[] board = new string[] {"XOX", "XOO", "OXX"};

अपेक्षित आउटपुट:
string expected = "Draw";

संदर्भ

यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

• GWU CS1111 Introduction to Software Development - lab sequence