From 8fbe4cd85c6ba52b9c48f4bf93b59ca12d6f33a3 Mon Sep 17 00:00:00 2001 From: Siyuan Liu Date: Tue, 15 Dec 2020 16:21:16 -0800 Subject: [PATCH] update the EditDistance content. --- dynamic_programming/EditDistance.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/dynamic_programming/EditDistance.md b/dynamic_programming/EditDistance.md index b2579e6..5dec92f 100644 --- a/dynamic_programming/EditDistance.md +++ b/dynamic_programming/EditDistance.md @@ -6,7 +6,7 @@ few days ago, I saw an interview paper of Tencent. In this paper, most of the algorithm problems are Dynamic programming. The last question is that writing a function to calculate the shortest editing Distance. Today I wrote an article specifically to discuss this problem. -I personally like this problem because it looks very hard, the solution is Surprisingly simple and beautiful and it`s a rare algorithm which is not very useful.(yech, I recognized that many algorithm problems are not very useful.)Following is the problem: +I personally like this problem because it looks very hard, the solution is Surprisingly simple and beautiful and it`s a rare algorithm which is very useful.(yech, I recognized that many algorithm problems are not very useful.)Following is the problem: ![](../pictures/editDistance/title.png) -- GitLab