Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 161 with 25 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 161 # by problem number
lcpy gen -s one_edit_distance # by problem name
s and t, return true if they are both one edit distance apart, otherwise return false.
A string s is said to be one distance apart from a string t if you can:
s to get t.s to get t.s to get t.Input: s = "ab", t = "acb"
Output: true
Explanation: We can insert 'c' into s to get t.
Input: s = "cab", t = "ad"
Output: false
Explanation: We cannot get t from s by only one step.
Input: s = "1203", t = "1213"
Output: true
Explanation: We can replace '0' with '1' to get t.
class Solution:
# Time: O(n)
# Space: O(1)
def is_one_edit_distance(self, s: str, t: str) -> bool:
if len(s) > len(t):
return self.is_one_edit_distance(t, s)
if len(t) - len(s) > 1:
return False
for i in range(len(s)):
if s[i] != t[i]:
if len(s) == len(t):
return s[i + 1 :] == t[i + 1 :]
return s[i:] == t[i + 1 :]
return len(s) + 1 == len(t)
| Time | Space |
|---|---|
| O(n) | O(1) |