mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-11 02:11:42 +08:00
批量更新数据
This commit is contained in:
@@ -5,7 +5,7 @@
|
||||
<ul>
|
||||
<li><code>0 <= i, j < words.length</code>,</li>
|
||||
<li><code>i != j</code> ,并且</li>
|
||||
<li><code>words[i] + words[j]</code>(两个字符串的连接)是一个回文。</li>
|
||||
<li><code>words[i] + words[j]</code>(两个字符串的连接)是一个<span data-keyword="palindrome-string">回文串</span>。</li>
|
||||
</ul>
|
||||
|
||||
<p>返回一个数组,它包含 <code>words</code> 中所有满足 <strong>回文对</strong> 条件的字符串。</p>
|
||||
|
Reference in New Issue
Block a user