mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-26 02:00:27 +08:00
31 lines
1021 B
HTML
31 lines
1021 B
HTML
|
<p>给定两个单词 <code>word1</code> 和<meta charset="UTF-8" /> <code>word2</code> ，返回使得<meta charset="UTF-8" /> <code>word1</code> 和 <meta charset="UTF-8" /> <code>word2</code><em> </em><strong>相同</strong>所需的<strong>最小步数</strong>。</p>
|
|||
|
|
|
|||
|
|
<p><strong>每步 </strong>可以删除任意一个字符串中的一个字符。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入:</strong> word1 = "sea", word2 = "eat"
|
|||
|
|
<strong>输出:</strong> 2
|
|||
|
|
<strong>解释:</strong> 第一步将 "sea" 变为 "ea" ，第二步将 "eat "变为 "ea"
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2:</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<b>输入：</b>word1 = "leetcode", word2 = "etco"
|
|||
|
|
<b>输出：</b>4
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
<meta charset="UTF-8" />
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= word1.length, word2.length <= 500</code></li>
|
|||
|
|
<li><code>word1</code> 和 <code>word2</code> 只包含小写英文字母</li>
|
|||
|
|
</ul>
|