File: root - text - article - 2019 - 10 - edit-distance.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 757 Views, 18605 Search Bots | 80 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Category: Computing | 757 Views, 18605 Search Bots | 80 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Problem, Data Structures and Algorithms, | English | Home Page | Cateogry: Computing | 757 Views, 18605 Search Bots | 80 Words 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
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Daily Interview Problem: Merge K Sorted Linked Lists
- Daily Interview Problem: Reverse Words in a String
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- Fibonacci coding
- Reverse a Linked List
- Algorithm Interview: Level Order Traversal of Binary Tree
- Autorun.inf Virus Protection
- Daily Interview Problem: Min Range Needed to Sort
- [Daily Problem] Angles of a Clock
- Daily Interview Problem:Create a balanced binary search tree
©2006~2024 SteakOverCooked - 0.01157 Seconds(s) - 1613.253 KB/s - 41 Online
Memory: 492.78 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !