标签：DP

题目链接 Leetcode 4. Median of Two Sorted Arrays 　　题目描述很简单，就是找到两个有序数组合并后的中位数，要求时间复杂度O(log (m+n))。 ~谢谢打赏~ 赏

赞(0)xindoo2017-10-31编程 阅读(4960)去评论

题目链接 Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of...

赞(0)xindoo2017-06-22算法 阅读(5576)去评论

题目链接：Unique Substrings in Wraparound String 这里加段英文，不是为了凑字数，而是为了让别人搜索题目的时候能搜到我的博客。。 Consider the string s to be the infin...

赞(0)xindoo2016-12-10算法 阅读(5765)去评论

题目链接：368. Largest Divisible Subset Given a set of distinct positive integers, find the largest subset such that every pa...

赞(0)xindoo2016-11-05算法 阅读(4985)去评论

题目链接：53.Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the lar...

赞(0)xindoo2016-08-07效率 阅读(4964)去评论