开发者

Insertions, deletions and substitutions between two strings

Given string A,B I need to compute the number o开发者_运维知识库f insertions, deletions and substitutions for B to become A. What would be a good algorithm for this?


That's known as Levenshtein distance.

0

上一篇:

下一篇:

精彩评论

暂无评论...
验证码 换一张
取 消

最新问答

问答排行榜