Best Time to Buy and Sell Stock IV

最新推荐文章于 2025-04-18 22:24:21 发布

iteye_6755

最新推荐文章于 2025-04-18 22:24:21 发布

阅读量62

点赞数

分类专栏： leetcode

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定股票价格数组时，在完成最多k次交易的情况下可以获得的最大利润。通过动态规划的方法，利用两个二维数组global和local来记录不同天数下完成不同次数交易所能获得的最大利润。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 at most k transactions.

public class Solution {
    public int maxProfit(int k, int[] prices) {
        if (prices == null || prices.length == 0) {
        	return 0;
        }
        if (k > prices.length) {
        	int res = 0;
        	for (int i = 0; i < prices.length-1; i++) {
				int tmp = prices[i + 1] - prices[i];
				if (tmp > 0) {
					res += tmp;
				}
			}
        	return res;
        }
        int[][] global = new int[prices.length][k+1];
        int[][] local = new int[prices.length][k+1];
        for (int i = 0; i < prices.length-1; i++) {
        	int tmp = prices[i + 1] - prices[i];
        	for (int j = 0; j < k; j++) {
        		local[i+1][j+1] = Math.max(global[i][j]+Math.max(tmp,0), local[i][j+1] + tmp);
        		global[i+1][j+1] = Math.max(global[i][j+1], local[i+1][j+1]);
			}
		}
        return global[prices.length-1][k];
    }
}