随笔分类 -  Dynamic Programming

1 2 下一页
动态规划
188. Best Time to Buy and Sell Stock IV——LeetCode
摘要：Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
posted @ 2018-09-14 18:01 丶Blank 阅读(271) 评论(0) 推荐(0)
123. Best Time to Buy and Sell Stock III ——LeetCode
摘要：Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
posted @ 2018-09-14 16:10 丶Blank 阅读(215) 评论(0) 推荐(0)
121. Best Time to Buy and Sell Stock——Leetcode
摘要：Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2018-09-14 11:13 丶Blank 阅读(241) 评论(0) 推荐(0)
Interleaving String——Leetcode
摘要：Givens1,s2,s3, find whethers3is formed by the interleaving ofs1ands2.For example,Given:s1="aabcc",s2="dbbca",Whens3="aadbbcbcac", return true.Whens3="... 阅读全文
posted @ 2015-10-19 17:27 丶Blank 阅读(219) 评论(0) 推荐(0)
Distinct Subsequences——Leetcode
摘要：Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig... 阅读全文
posted @ 2015-09-22 00:16 丶Blank 阅读(160) 评论(0) 推荐(0)
Perfect Squares——Leetcode
摘要：Given a positive integern, find the least number of perfect square numbers (for example,1, 4, 9, 16, ...) which sum ton.For example, givenn=12, return... 阅读全文
posted @ 2015-09-20 17:03 丶Blank 阅读(147) 评论(0) 推荐(0)
House Robber II——Leetcode
摘要：After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This t... 阅读全文
posted @ 2015-09-20 16:44 丶Blank 阅读(161) 评论(0) 推荐(0)
Unique Paths II ——LeetCode
摘要：Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space i... 阅读全文
posted @ 2015-06-25 13:41 丶Blank 阅读(157) 评论(0) 推荐(0)
Unique Paths ——LeetCode
摘要：A robot is located at the top-left corner of amxngrid (marked 'Start' in the diagram below).The robot can only move either down or right at any point ... 阅读全文
posted @ 2015-06-25 13:39 丶Blank 阅读(132) 评论(0) 推荐(0)
Unique Binary Search Trees——LeetCode
摘要：Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1... 阅读全文
posted @ 2015-05-01 14:06 丶Blank 阅读(166) 评论(0) 推荐(0)
Maximum Product Subarray——LeetCode
摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the... 阅读全文
posted @ 2015-04-23 16:37 丶Blank 阅读(175) 评论(0) 推荐(0)
Maximum Subarray——LeetCode
摘要：Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,... 阅读全文
posted @ 2015-04-23 11:27 丶Blank 阅读(137) 评论(0) 推荐(0)
Minimum Path Sum——LeetCode
摘要：Given amxngrid filled with non-negative numbers, find a path from top left to bottom right whichminimizesthe sum of all numbers along its path.Note:Yo... 阅读全文
posted @ 2015-04-20 16:36 丶Blank 阅读(174) 评论(0) 推荐(0)
Triangle——LeetCode
摘要：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol... 阅读全文
posted @ 2015-04-09 16:03 丶Blank 阅读(135) 评论(0) 推荐(0)
Best Time to Buy and Sell Stock II ——LeetCode
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2015-04-09 12:15 丶Blank 阅读(147) 评论(0) 推荐(0)
Best Time to Buy and Sell Stock——LeetCode
摘要：Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文
posted @ 2015-04-09 00:36 丶Blank 阅读(129) 评论(0) 推荐(0)
POJ1163——The Triangle
摘要：Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of... 阅读全文
posted @ 2015-04-02 21:13 丶Blank 阅读(492) 评论(0) 推荐(0)
House Robber——LeetCode
摘要：You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo... 阅读全文
posted @ 2015-03-31 23:36 丶Blank 阅读(290) 评论(0) 推荐(0)
01背包之求第K优解——Bone Collector II
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=2639题目大意是，往背包里赛骨头，求第K优解，在普通01背包的基础上，增加一维空间，那么F[i,v,k]可以理解为前i个物品，放入容量v的背包时，第K优解的值。时间复杂度为O(NVK)。Talk is cheap.... 阅读全文
posted @ 2015-03-17 23:08 丶Blank 阅读(245) 评论(0) 推荐(0)
动态规划初级练习（二）：BadNeighbors
摘要：Problem StatementThe old song declares "Go ahead and hate your neighbor", and the residents of Onetinville have taken those words to heart. Every resident hates his next-door neighbors on both sides. Nobody is willing to live farther away from the town's well than his neighbors, so the 阅读全文
posted @ 2013-09-09 09:16 丶Blank 阅读(510) 评论(0) 推荐(0)

1 2 下一页