文件: root - text - article - 2019 - 10 - edit-distance.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 749 次阅读, 17805 次搜索 | 80 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 749 次阅读, 17805 次搜索 | 80 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by AirBNB:
Given two strings, determine the edit distance between them. The edit distance is defined as the minimum number of edits (insertion, deletion, or substitution) needed to change one string to the other.
For example, "biting" and "sitting" have an edit distance of 2 (substitute b for s, and insert a t).
Here's the signature:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | 英文 | 主页 | 类别: 计算机科学 | 749 次阅读, 17805 次搜索 | 80 个单词 Given two strings, determine the edit distance between them. The edit distance is defined as the minimum number of edits (insertion, deletion, or substitution) needed to change one string to the other.
For example, "biting" and "sitting" have an edit distance of 2 (substitute b for s, and insert a t).
Here's the signature:
def distance(s1, s2):
# Fill this in.
print distance('biting', 'sitting')
# 2
猜您喜欢...
- Daily Interview Problem: Decode String
- Algorithm Interview: Permutations of numbers
- Daily Interview Problem: Room scheduling
- Floor and Ceiling of a Binary Search Tree
- Non-decreasing Array with Single Modification
- Daily Interview Problem: 3 Sum
- Find Pythagorean Triplets
- Print a tree level-by-level, with line-breaks
- Invert a Binary Tree
- [Daily Problem] Longest Palindromic Substring
©2006~2024 牛排过熟 - 0.01241 秒 - 4255.27 KB/s - 14 在线 内存: 530.77 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。