mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 11:21:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
15
算法题(国内版)/problem (Chinese)/最长单词 [longest-word-lcci].html
Normal file
15
算法题(国内版)/problem (Chinese)/最长单词 [longest-word-lcci].html
Normal file
@@ -0,0 +1,15 @@
|
||||
<p>给定一组单词<code>words</code>,编写一个程序,找出其中的最长单词,且该单词由这组单词中的其他单词组合而成。若有多个长度相同的结果,返回其中字典序最小的一项,若没有符合要求的单词则返回空字符串。</p>
|
||||
|
||||
<p><strong>示例:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong> ["cat","banana","dog","nana","walk","walker","dogwalker"]
|
||||
<strong>输出:</strong> "dogwalker"
|
||||
<strong>解释:</strong> "dogwalker"可由"dog"和"walker"组成。
|
||||
</pre>
|
||||
|
||||
<p><strong>提示:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>0 <= len(words) <= 200</code></li>
|
||||
<li><code>1 <= len(words[i]) <= 100</code></li>
|
||||
</ul>
|
Reference in New Issue
Block a user