Skip to content
Merged
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
fix(leetcode46):hight light leetcode46
  • Loading branch information
lixiaoyu committed Aug 3, 2020
commit ea2386a4497aad2eea053b509c611dfe64c8e17a
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -263,7 +263,7 @@ Output: [3,5]
> 1. The order of the result is not important. So in the above example, [5, 3] is also correct.
> 2. Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?

46. ***【Edit Distance】*** Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.
46. ***【Edit Distance】(./doc/Leetcode46/Leetcode46.md)*** Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.
You have the following 3 operations permitted on a word:
1. Insert a character
2. Delete a character
Expand Down