mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
42 lines
1.9 KiB
HTML
42 lines
1.9 KiB
HTML
|
<p>设计一个算法，判断玩家是否赢了井字游戏。输入是一个 N x N 的数组棋盘，由字符" "，"X"和"O"组成，其中字符" "代表一个空位。</p>
|
|||
|
|
|
|||
|
|
<p>以下是井字游戏的规则：</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>玩家轮流将字符放入空位（" "）中。</li>
|
|||
|
|
<li>第一个玩家总是放字符"O"，且第二个玩家总是放字符"X"。</li>
|
|||
|
|
<li>"X"和"O"只允许放置在空位中，不允许对已放有字符的位置进行填充。</li>
|
|||
|
|
<li>当有N个相同（且非空）的字符填充任何行、列或对角线时，游戏结束，对应该字符的玩家获胜。</li>
|
|||
|
|
<li>当所有位置非空时，也算为游戏结束。</li>
|
|||
|
|
<li>如果游戏结束，玩家不允许再放置字符。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p>如果游戏存在获胜者，就返回该游戏的获胜者使用的字符（"X"或"O"）；如果游戏以平局结束，则返回 "Draw"；如果仍会有行动（游戏未结束），则返回 "Pending"。</p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong> board = ["O X"," XO","X O"]
|
|||
|
|
<strong>输出：</strong> "X"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong> board = ["OOX","XXO","OXO"]
|
|||
|
|
<strong>输出：</strong> "Draw"
|
|||
|
|
<strong>解释：</strong> 没有玩家获胜且不存在空位
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入：</strong> board = ["OOX","XXO","OX "]
|
|||
|
|
<strong>输出：</strong> "Pending"
|
|||
|
|
<strong>解释：</strong> 没有玩家获胜且仍存在空位
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= board.length == board[i].length <= 100</code></li>
|
|||
|
|
<li>输入一定遵循井字棋规则</li>
|
|||
|
|
</ul>
|