标签：DP

2017-10-31xindoo阅读(4813)评论(0)赞(0)

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

2017-06-22xindoo阅读(5078)评论(0)赞(0)

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

2016-12-10xindoo阅读(5522)评论(0)赞(0)

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

2016-11-05xindoo阅读(4672)评论(0)赞(0)

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

2016-08-07xindoo阅读(4732)评论(0)赞(0)

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