mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
23 lines
533 B
HTML
23 lines
533 B
HTML
<p>字符串有三种编辑操作:插入一个英文字符、删除一个英文字符或者替换一个英文字符。 给定两个字符串，编写一个函数判定它们是否只需要一次(或者零次)编辑。</p>
|
|
|
|
<p> </p>
|
|
|
|
<p><strong>示例 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>输入:</strong>
|
|
first = "pale"
|
|
second = "ple"
|
|
<strong>输出:</strong> True</pre>
|
|
|
|
<p> </p>
|
|
|
|
<p><strong>示例 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>输入:</strong>
|
|
first = "pales"
|
|
second = "pal"
|
|
<strong>输出:</strong> False
|
|
</pre>
|