583. 两个字符串的删除操作
解法:最长公共子序列
可以参考之前的代码求得最长公共子序列的长度,再分别用两个字符串的长度减掉子序列的长度,再求和即为结果。
class Solution:
def minDistance(self, word1: str, word2: str) -> int:
m, n = len(word1), len(word2)
dp = [[0] * (n + 1) for _ in range(m + 1)]
for i in range(1, m + 1):
for j in range(1, n + 1):
if word1[i - 1] == word2[j - 1]:
dp[i][j] = dp[i - 1][j - 1] + 1
else:
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
lcs = dp[m][n]
return m - lcs + n - lcs
599. 两个列表的最小索引
解法:哈希表
先用一个哈希表存储Andy喜欢的餐厅对应的索引,再遍历Doris喜欢的餐厅,对其是否在哈希表中进行判断,若在,则计算索引和,若为最小索引和,则更新结果。直到遍历结束。
class Solution:
def findRestaurant(self, list1: List[str], list2: List[str]) -> List[str]:
n2id = {}
min_sum = float("inf")
result = []
for i, name in enumerate(list1):
if name not in n2id:
n2id[name] = i
for i, name in enumerate(list2):
if name in n2id:
# print(i + n2id[name])
if i + n2id[name] < min_sum:
result = [name]
min_sum = i + n2id[name]
elif i + n2id[name] == min_sum:
result.append(name)
return result