Leetcode 72: Edit Distance

June 21, 2017

Introduction

Plan to work on Leetcode 72: Edit Distance again. The problem statement is here.

Algorithm study 

Julia's C# practice is here. 

Follow up

Dec. 10, 2019 10:49 PM

It is better to add code to the blog. Also I spent 10 minutes to review the code, there are three cases involved to build next iteration in dynamic programming, left, top, and left and top, first two the increment is 1, last one may be one or zero, depending on last char in two strings are the same or not.

This definitely is a good practice question for dynamic programming.