mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-12 10:51:42 +08:00
批量更新数据
This commit is contained in:
@@ -2,26 +2,26 @@
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1:</strong></p>
|
||||
<p><strong>示例 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong> words = <code>["abcw","baz","foo","bar","fxyz","abcdef"]</code>
|
||||
<strong>输出: </strong><code>16
|
||||
<strong>解释:</strong> 这两个单词为<strong> </strong></code><code>"abcw", "fxyz"</code>。它们不包含相同字符,且长度的乘积最大。</pre>
|
||||
<strong>输入:</strong>words = ["abcw","baz","foo","bar","fxyz","abcdef"]
|
||||
<strong>输出:</strong>16
|
||||
<strong>解释:</strong>这两个单词为<strong> </strong>"abcw", "fxyz"。它们不包含相同字符,且长度的乘积最大。</pre>
|
||||
|
||||
<p><strong>示例 2:</strong></p>
|
||||
<p><strong>示例 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong> words = <code>["a","ab","abc","d","cd","bcd","abcd"]</code>
|
||||
<strong>输出: </strong><code>4
|
||||
<strong>解释: </strong></code>这两个单词为 <code>"ab", "cd"</code>。</pre>
|
||||
<strong>输入:</strong>words = ["a","ab","abc","d","cd","bcd","abcd"]
|
||||
<strong>输出:</strong>4
|
||||
<strong>解释:</strong>这两个单词为 "ab", "cd"。</pre>
|
||||
|
||||
<p><strong>示例 3:</strong></p>
|
||||
<p><strong>示例 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong> words = <code>["a","aa","aaa","aaaa"]</code>
|
||||
<strong>输出: </strong><code>0
|
||||
<strong>解释: </strong>不存在这样的两个单词。</code>
|
||||
<strong>输入:</strong>words = ["a","aa","aaa","aaaa"]
|
||||
<strong>输出:</strong>0
|
||||
<strong>解释:</strong>不存在这样的两个单词。
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
|
Reference in New Issue
Block a user