coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 19:31:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

add leetcode problem-cn part2

Browse Source
This commit is contained in:
小墨
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
算法题（国内版）/problem (Chinese)/单词矩阵 [word-rectangle-lcci].html Normal file
View File

@@ -0,0 +1,26 @@
<p>给定一份单词的清单，设计一个算法，创建由字母组成的面积最大的矩形，其中每一行组成一个单词(自左向右)，每一列也组成一个单词(自上而下)。不要求这些单词在清单里连续出现，但要求所有行等长，所有列等高。</p>
<p>如果有多个面积最大的矩形，输出任意一个均可。一个单词可以重复使用。</p>
<p><strong>示例 1:</strong></p>
<pre><strong>输入:</strong> <code>[&quot;this&quot;, &quot;real&quot;, &quot;hard&quot;, &quot;trh&quot;, &quot;hea&quot;, &quot;iar&quot;, &quot;sld&quot;]</code>
<strong>输出:
</strong><code>[
&nbsp; &quot;this&quot;,
&nbsp; &quot;real&quot;,
&nbsp; &quot;hard&quot;</code>
]</pre>
<p><strong>示例 2:</strong></p>
<pre><strong>输入:</strong> <code>[&quot;aa&quot;]</code>
<strong>输出: </strong>[&quot;aa&quot;,&quot;aa&quot;]</pre>
<p><strong>说明：</strong></p>
<ul>
<li><code>words.length &lt;= 1000</code></li>
<li><code>words[i].length &lt;= 100</code></li>
<li>数据保证单词足够随机</li>
</ul>