mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
45 lines
1.2 KiB
HTML
45 lines
1.2 KiB
HTML
|
<p>给你两个单词 <code>word1</code> 和 <code>word2</code>， <em>请返回将 <code>word1</code> 转换成 <code>word2</code> 所使用的最少操作数</em> 。</p>
|
|||
|
|
|
|||
|
|
<p>你可以对一个单词进行如下三种操作：</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>插入一个字符</li>
|
|||
|
|
<li>删除一个字符</li>
|
|||
|
|
<li>替换一个字符</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>word1 = "horse", word2 = "ros"
|
|||
|
|
<strong>输出：</strong>3
|
|||
|
|
<strong>解释：</strong>
|
|||
|
|
horse -> rorse (将 'h' 替换为 'r')
|
|||
|
|
rorse -> rose (删除 'r')
|
|||
|
|
rose -> ros (删除 'e')
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>word1 = "intention", word2 = "execution"
|
|||
|
|
<strong>输出：</strong>5
|
|||
|
|
<strong>解释：</strong>
|
|||
|
|
intention -> inention (删除 't')
|
|||
|
|
inention -> enention (将 'i' 替换为 'e')
|
|||
|
|
enention -> exention (将 'n' 替换为 'x')
|
|||
|
|
exention -> exection (将 'n' 替换为 'c')
|
|||
|
|
exection -> execution (插入 'u')
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>0 <= word1.length, word2.length <= 500</code></li>
|
|||
|
|
<li><code>word1</code> 和 <code>word2</code> 由小写英文字母组成</li>
|
|||
|
|
</ul>
|