coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

42
leetcode-cn/problem (English)/一次编辑(English) [one-away-lcci].html
View File

@@ -1,21 +1,21 @@
<p>There are three types of edits that can be performed on strings: insert a character, remove a character, or replace a character. Given two strings, write a function to check if they are one edit (or zero edits) away.</p>
<p>&nbsp;</p>
<p><strong>Example&nbsp;1:</strong></p>
<pre>
<strong>Input:</strong>
first = &quot;pale&quot;
second = &quot;ple&quot;
<strong>Output:</strong> True
</pre>
<p><strong>Example&nbsp;2:</strong></p>
<pre>
<strong>Input:</strong>
first = &quot;pales&quot;
second = &quot;pal&quot;
<strong>Output:</strong> False
</pre>
<p>There are three types of edits that can be performed on strings: insert a character, remove a character, or replace a character. Given two strings, write a function to check if they are one edit (or zero edits) away.</p>
<p>&nbsp;</p>
<p><strong>Example&nbsp;1:</strong></p>
<pre>
<strong>Input:</strong>
first = &quot;pale&quot;
second = &quot;ple&quot;
<strong>Output:</strong> True