x******0
发帖数: 178 | 1 Given two strings s and d, and a dictionary, convert s to d:
1. every time we can only add/delete/modify one char from s
2. every intermediate string must be in the dictionary
Ask for the minimum number of steps to finish the conversion.
标准的edit distance + word ladder
先说算法，然后要求写代码
三哥 |
q****m
发帖数: 177 | 2 看来三哥没少刷题啊。电面都搞这么难，这太搞笑了。
【在 x******0 的大作中提到】
: Given two strings s and d, and a dictionary, convert s to d:
: 1. every time we can only add/delete/modify one char from s
: 2. every intermediate string must be in the dictionary
: Ask for the minimum number of steps to finish the conversion.
: 标准的edit distance + word ladder
: 先说算法，然后要求写代码
: 三哥
|
C******8
发帖数: 501 | 3 w是哪里？
【在 x******0 的大作中提到】
: Given two strings s and d, and a dictionary, convert s to d:
: 1. every time we can only add/delete/modify one char from s
: 2. every intermediate string must be in the dictionary
: Ask for the minimum number of steps to finish the conversion.
: 标准的edit distance + word ladder
: 先说算法，然后要求写代码
: 三哥
|
f******x
发帖数: 2260 | |
l******t
发帖数: 55733 | 5 Walmart
【在 C******8 的大作中提到】
: w是哪里？
|
