发信人: xbox1080 (dapangpang2012), 信区: JobHunting
标 题: W家一道电面题
发信站: BBS 未名空间站 (Mon May 19 14:05:41 2014, 美东)
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
先说算法，然后要求写代码
三哥
--
※ 来源:·WWW 未名空间站 网址：mitbbs.com 移动：在应用商店搜索未名空间·[FROM: 50.]
Monday, June 9, 2014
W家一道电面题
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment