![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dynamic programming
文章平均质量分 77
gunxueqiucjw
这个作者很懒,什么都没留下…
展开
-
leetcode Palindrome I and II comparison
The easier one "Palindrome I" is solved by DFS ALG 1. From left to right, judge the substr(0, i) is Palindrome or not. If it is, add it to one of the element of the answer. Then use partition to find原创 2015-01-02 09:58:08 · 505 阅读 · 0 评论 -
leetcode word break I && II
Two dynamic programming problem problem II can use the code of problem I Word Break I class Solution { public: int longestWord(unordered_set dict) { unordered_set::iterator it;原创 2015-01-02 16:13:05 · 762 阅读 · 0 评论