动态规划
文章平均质量分 74
HCacm
这个作者很懒,什么都没留下…
展开
-
leetcode 5. Longest Palindromic Substring
Discription Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: “babad”Output: “bab”Note: “aba” is also a valid answer.原创 2017-10-10 22:06:01 · 178 阅读 · 0 评论 -
leetcode 97. Interleaving String
相关问题Discription 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 = “aadbbbacc原创 2017-10-31 14:35:05 · 266 阅读 · 1 评论