DP
文章平均质量分 66
ep_mashiro
日拱一卒,功不唐捐
展开
-
Leetcode_Best Time to Buy and Sell Stock
Tag Array/Dynamic Programming Difficulty Easy Description 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 on原创 2017-02-27 12:18:50 · 429 阅读 · 0 评论 -
Leetcode_Maximum Subarray
Tag Array\Dynamic Programming\Divide and Conquer Difficulty Easy Description Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example,原创 2017-02-27 13:15:45 · 246 阅读 · 0 评论 -
Leetcode 动态规划知识点总结
来看下Leetcode中Tag为Dynamic Programming的题目股票买卖系列小偷光顾房子系列斐波那列序列及其变种70. Climbing Stairs:爬山问题,Easy dp[i] = dp[i-1]+dp[i-2]746. Min Cost Climbing Stairs:爬山问题,需要支付cost[i]费用,Easyclass Sol...原创 2018-03-13 20:42:53 · 388 阅读 · 0 评论