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 583 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 583 # by problem number
lcpy gen -s delete_operation_for_two_strings # by problem name
word1 and word2, return the minimum number of steps required to make word1 and word2 the same.
In one step, you can delete exactly one character in either string.
Input: word1 = "sea", word2 = "eat"
Output: 2
Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".
Input: word1 = "leetcode", word2 = "etco"
Output: 4
class Solution:
# Time: O(n * m)
# Space: O(m)
def min_distance(self, word1: str, word2: str) -> int:
m = len(word2)
prev = list(range(m + 1))
for i in range(1, len(word1) + 1):
curr = [i] + [0] * m
for j in range(1, m + 1):
if word1[i - 1] == word2[j - 1]:
curr[j] = prev[j - 1]
else:
curr[j] = 1 + min(prev[j], curr[j - 1])
prev = curr
return prev[m]
| Time | Space |
|---|---|
| O(n * m) | O(m) |