摘要: 编辑距离和最长公共子串问题都是经典的DP问题,首先来看看编辑距离问题:问题描述Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each ope... 阅读全文
posted @ 2015-06-19 14:46 Chapter 阅读(363) 评论(0) 推荐(0) 编辑