1 题目理解

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 complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times) with the following restrictions:

You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
After you sell your stock, you cannot buy stock on next day. (ie, cooldown 1 day)
Example:

Input: [1,2,3,0,2]
Output: 3
Explanation: transactions = [buy, sell, cooldown, buy, sell]

2 动态规划

class Solution {public int maxProfit(int[] prices) {if(prices == null || prices.length == 0) return 0;int n = prices.length;int[][] dp = new int[n][3];dp[0][0] = -prices[0];for(int i=1;i<n;i++){dp[i][0] = Math.max(dp[i-1][2] - prices[i], dp[i-1][0]);dp[i][1] = dp[i-1][0] + prices[i];dp[i][2] = Math.max(dp[i-1][2],dp[i-1][1]);}return Math.max(dp[n-1][1],dp[n-1][2]);}
}

309. Best Time to Buy and Sell Stock with Cooldown相关推荐

【DP + 卖股票】LeetCode 309. Best Time to Buy and Sell Stock with Cooldown
LeetCode 309. Best Time to Buy and Sell Stock with Cooldown Solution1: 比较有难度的一道动态规划题了! 参考网址:http://z ...
【LeetCode】309. Best Time to Buy and Sell Stock with Cooldown 最佳买卖股票时机含冷冻期（Medium）（JAVA）
[LeetCode]309. Best Time to Buy and Sell Stock with Cooldown 最佳买卖股票时机含冷冻期(Medium)(JAVA) 题目地址: https: ...
309. Best Time to Buy and Sell Stock with Cooldown**
309. Best Time to Buy and Sell Stock with Cooldown** https://leetcode.com/problems/best-time-to-buy- ...
[刷题]leetcode #309 - Best Time to Buy and Sell Stock with Cooldown
题目代码 class Solution {public int maxProfit(int[] prices) {if (prices.length <= 1) return 0;int l ...
【leetcode-Python】-Dynamic Programming -309. Best Time to Buy and Sell Stock with Cooldown
题目链接 https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/ 题目描述给定价格数组prices, ...
【LeetCode】309. Best Time to Buy and Sell Stock with Cooldown 解题报告（Python C++）
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法动态规划日期题目地址:https://leetc ...
309. Best Time to Buy and Sell Stock with Cooldown
题目: Say you have an array for which the ith element is the price of a given stock on day i. Design a ...
[leetcode] 309. Best Time to Buy and Sell Stock with Cooldown 解题报告
题目链接:https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/ Say you have an ar ...
【Java力扣算法】LeetCode 309 Best Time to Buy and Sell Stock with Cooldown（动态规划）
题目: 给定一个整数数组,其中第 i 个元素代表了第 i 天的股票价格 . 设计一个算法计算出最大利润.在满足以下约束条件下,你可以尽可能地完成更多的交易(多次买卖一支股票): 你不能同时参与多笔交 ...
309.Best Time to Buy and Sell Stock with Cooldown
1.基本思路: 此题可通过DP来解决,但状态转移方程的构想不是那么明显,首先可以通过两个数组来表示买与卖的信息: buy[i]:表示第i天为止,最近一次股票购入后所持有的利润 sell[i]:表示第i ...

309. Best Time to Buy and Sell Stock with Cooldown

1 题目理解

2 动态规划

309. Best Time to Buy and Sell Stock with Cooldown相关推荐

最新文章

热门文章