Leetcode之Edit Distance 問題

問題描述: Given two words word1 and word2, find the minimum number of steps required to convertword1 toword2. (each operation is counted as 1 step.) You have the following 3 operations permitted on a word

>>阅读原文<<