摘要： 看背包问题 复习了下leetcode 的72 动态规划 class Solution {public: int minDistance(string word1, string word2) { int n1 = word1.length(); int n2 = word2.length(); ve 阅读全文