05 Best Time to Buy and Sell Stock II

最新推荐文章于 2024-05-20 20:08:58 发布

caron4

最新推荐文章于 2024-05-20 20:08:58 发布

阅读量55

点赞数

分类专栏： 30 day-Leetcoding-Chanlenge 文章标签：贪心算法算法动态规划

本文链接：https://blog.csdn.net/qq_40669895/article/details/125734003

版权

30 day-Leetcoding-Chanlenge 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

Best Time to Buy and Sell Stock II

描述: Best Time to Buy and Sell Stock II

Say you have an array for which the i th elements is the price of a given stock on day i;
Design an algorithm to find the maximum profit. You may complete as many transcations as you like(
i,e., buy one and sell one share of the stock multipke tines).

Note: you may not engage in multiple transcations at the same time(i.e., you must sell the stock before you bou again).

Exmaple 1:
Input; [7, 1, 5, 3, 6, 4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5 - 1 = 4.
Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6 - 3 = 3.

Exmaple 2:
Input; [1, 2, 3, 4, 5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5 - 1 = 4.
Note that you cannnot buy on day 1, buy on day 2 and sell them later, as you are
engaginm multiple transcations at the same time. You must sell before buying angain.

Exmaple 3:
Input; [7, 6, 3, 4, 1]
Output: 0
Explanation: In this case. No transcation is done, i.e. max profit = 0;

给出函数方法:

int MaxProfit(int* prices, int PriceSize);

01方法1: 动态规划

代码如下:

int maxProfit1(int* prices, int pricesSize) {
        // 最后天卖不卖的问题
        if(pricesSize <= 1){
            return 0;   //没有获利
        }
        int profits[pricesSize + 1] = {0};
        profits[1] = 0;
        for(int k = 2; k <= pricesSize; k++){
             int profit= 0;
        int max = 0;

        // 最后一天决定不卖
        profit = profits[ k - 1];
        if(profit > max){
            max = profit;
        }

        // 最后一天决定卖出去
        for(int i = 1; i <= k - 1; i++){
            profit = profits[i] + prices[k - 1] - prices[i - 1];
            if(profit > max){
                max = profit;
            }
        }
        profits[k] = max;
    }

    return profits[pricesSize];
       
}

02方法2: 贪心算法

代码如下:

int MaxProfit2(int* prices, int pricesSize){
    int total = 0;
    for(int i = 0 ;i+1 <pricesSize; i++ ){
        if(prices[i] < prices[i+1]){
            total += prices[i+1] - prices[i];
        }
    }
    return total;
}

测试代码如下:

int prices[] = { 7,1,4,3,6 };
	int pricesSize = sizeof(prices) / sizeof(prices[0]);
	int profit = 0;
	//int profit =  MaxProfit1(prices, pricesSize);
	//cout << "动态规划结果:" << profit << endl;

	profit = MaxProfit2(prices, pricesSize);
	cout << "贪心算法结果: " << profit << endl;