dp
john_and_betty
这个作者很懒,什么都没留下…
展开
-
Interleaving String
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example, Given: s1 = "aabcc", s2 = "dbbca", When s3 = "aadbbcbcac", return true. When s3 = "aadbbbaccc",转载 2014-03-13 20:36:29 · 305 阅读 · 0 评论 -
Edit Distance
现在觉得看懂了,但是几天后要是再做的话,还是不会,一定要学会dp class Solution { public: int minDistance(string word1, string word2) { vector>f(word1.size()+1,vector(word2.size()+1)); for(int i=0;i<word1.size()+1原创 2014-03-16 21:20:33 · 370 阅读 · 0 评论 -
Palindrome Partitioning II
1 2 定义函数 D[i,n] = 区间[i,n]之间最小的cut数,n为字符串长度 a b a b b b a b b a b a i n 如果现在求[i,n]之间的最优解?应该是多少?简单看一看,至少有下面一个解 a b原创 2014-03-20 20:53:39 · 349 阅读 · 0 评论