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