题目:
我的解法:动态规划
class Solution {
public int maxProfit(int k, int[] prices) {
int n = prices.length;
if(n==0){
return 0;
}
// have[i][j]表示第i天有股票在手里,且交易次数为j;nohave[i][j]表示第i天没有股票在手里,交易次数为j
int[][] have = new int[n][k+1];
int[][] nohave = new int[n][k+1];
int max = 0;
have[0][0] = -prices[0];
nohave[0][0] = 0;
for(int i=1; i<k; i++){
have[0][i] = Integer.MIN_VALUE/2;
nohave[0][i] = Integer.MIN_VALUE/2;
}
for(int i=1; i<n; i++){
have[i][0] = Math.max(have[i-1][0], nohave[i-1][0] - prices[i]);
for(int j=1; j<=k; j++){
have[i][j] = Math.max(have[i-1][j], nohave[i-1][j] - prices[i]);
nohave[i][j] = Math.max(have[i-1][j-1] + prices[i], nohave[i-1][j]);
if(nohave[i][j]>max){
max = nohave[i][j];
}
}
}
return max;
}
}
官方题解:
class Solution {
public int maxProfit(int k, int[] prices) {
if (prices.length == 0) {
return 0;
}
int n = prices.length;
k = Math.min(k, n / 2);
int[][] buy = new int[n][k + 1];
int[][] sell = new int[n][k + 1];
buy[0][0] = -prices[0];
sell[0][0] = 0;
for (int i = 1; i <= k; ++i) {
buy[0][i] = sell[0][i] = Integer.MIN_VALUE / 2;
}
for (int i = 1; i < n; ++i) {
buy[i][0] = Math.max(buy[i - 1][0], sell[i - 1][0] - prices[i]);
for (int j = 1; j <= k; ++j) {
buy[i][j] = Math.max(buy[i - 1][j], sell[i - 1][j] - prices[i]);
sell[i][j] = Math.max(sell[i - 1][j], buy[i - 1][j - 1] + prices[i]);
}
}
return Arrays.stream(sell[n - 1]).max().getAsInt();
}
}
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/solution/mai-mai-gu-piao-de-zui-jia-shi-ji-iv-by-8xtkp/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
class Solution {
public int maxProfit(int k, int[] prices) {
if (prices.length == 0) {
return 0;
}
int n = prices.length;
k = Math.min(k, n / 2);
int[] buy = new int[k + 1];
int[] sell = new int[k + 1];
buy[0] = -prices[0];
sell[0] = 0;
for (int i = 1; i <= k; ++i) {
buy[i] = sell[i] = Integer.MIN_VALUE / 2;
}
for (int i = 1; i < n; ++i) {
buy[0] = Math.max(buy[0], sell[0] - prices[i]);
for (int j = 1; j <= k; ++j) {
buy[j] = Math.max(buy[j], sell[j] - prices[i]);
sell[j] = Math.max(sell[j], buy[j - 1] + prices[i]);
}
}
return Arrays.stream(sell).max().getAsInt();
}
}
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/solution/mai-mai-gu-piao-de-zui-jia-shi-ji-iv-by-8xtkp/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。