tic-tac-toe-lcci

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

本书是原谷歌资深面试官的经验之作，帮助了许多想要加入脸书、苹果、谷歌等 IT 名企的求职者拿到 Dream offer。本专题的 100+ 编程面试题是在原书基础上精心挑选出来的，帮助你轻松应战 IT 名企技术面试。

英文版：Cracking the Coding Interview，源自硅谷程序员的面试红宝书

LCCI

Design an algorithm to figure out if someone has won a game of tic-tac-toe.&nbsp;Input is a string array&nbsp;of size N x N, including characters &quot; &quot;, &quot;X&quot; and &quot;O&quot;, where &quot; &quot; represents a empty grid.

The rules of tic-tac-toe are as follows:

<ul>
	<li>Players place characters into an empty grid(&quot; &quot;) in turn.</li>
	<li>The first player always place character &quot;O&quot;, and the second one place &quot;X&quot;.</li>
	<li>Players are only allowed to place characters in empty grid. Replacing a character is not allowed.</li>
	<li>If there is any row, column or diagonal filled with N&nbsp;same characters, the game ends. The player who place the last charater wins.</li>
	<li>When there is no empty grid, the game ends.</li>
	<li>If the game ends, players cannot place any character further.</li>
</ul>

If there is any winner, return the character that the winner used. If there&#39;s a draw, return &quot;Draw&quot;. If the game doesn&#39;t end and there is no winner, return &quot;Pending&quot;.

Example 1: 

<pre>
Input: board = [&quot;O X&quot;,&quot; XO&quot;,&quot;X O&quot;]
Output: &quot;X&quot;
</pre>

Example 2: 

<pre>
Input: board = [&quot;OOX&quot;,&quot;XXO&quot;,&quot;OXO&quot;]
Output: &quot;Draw&quot;
Explanation: no player wins and no empty grid left
</pre>

Example 3: 

<pre>
Input: board = [&quot;OOX&quot;,&quot;XXO&quot;,&quot;OX &quot;]
Output: &quot;Pending&quot;
Explanation: no player wins but there is still a empty grid
</pre>

Note: 

<ul>
	<li><code>1 &lt;= board.length == board[i].length &lt;= 100</code></li>
	<li>Input follows the rules.</li>
</ul>

tictactoe

Tic-Tac-Toe LCCI

Array

Counting

Matrix

设计一个算法，判断玩家是否赢了井字游戏。输入是一个 N x N 的数组棋盘，由字符&quot; &quot;，&quot;X&quot;和&quot;O&quot;组成，其中字符&quot; &quot;代表一个空位。

以下是井字游戏的规则：

<ul>
	<li>玩家轮流将字符放入空位（&quot; &quot;）中。</li>
	<li>第一个玩家总是放字符&quot;O&quot;，且第二个玩家总是放字符&quot;X&quot;。</li>
	<li>&quot;X&quot;和&quot;O&quot;只允许放置在空位中，不允许对已放有字符的位置进行填充。</li>
	<li>当有N个相同（且非空）的字符填充任何行、列或对角线时，游戏结束，对应该字符的玩家获胜。</li>
	<li>当所有位置非空时，也算为游戏结束。</li>
	<li>如果游戏结束，玩家不允许再放置字符。</li>
</ul>

如果游戏存在获胜者，就返回该游戏的获胜者使用的字符（&quot;X&quot;或&quot;O&quot;）；如果游戏以平局结束，则返回 &quot;Draw&quot;；如果仍会有行动（游戏未结束），则返回 &quot;Pending&quot;。

示例 1：

<pre>输入： board = [&quot;O X&quot;,&quot; XO&quot;,&quot;X O&quot;]
输出： &quot;X&quot;
</pre>

示例 2：

<pre>输入： board = [&quot;OOX&quot;,&quot;XXO&quot;,&quot;OXO&quot;]
输出： &quot;Draw&quot;
解释： 没有玩家获胜且不存在空位
</pre>

示例 3：

<pre>输入： board = [&quot;OOX&quot;,&quot;XXO&quot;,&quot;OX &quot;]
输出： &quot;Pending&quot;
解释： 没有玩家获胜且仍存在空位
</pre>

提示：

<ul>
	<li><code>1 &lt;= board.length == board[i].length &lt;= 100</code></li>
	<li>输入一定遵循井字棋规则</li>
</ul>