Best Time to Buy and Sell Stock III

最新推荐文章于 2022-04-26 10:52:27 发布

uj_mosquito

最新推荐文章于 2022-04-26 10:52:27 发布

阅读量677

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/uj_mosquito/article/details/42393491

LeetCode 专栏收录该内容

86 篇文章

订阅专栏

本文探讨了在股票市场中通过最多两次交易获取最大利润的算法。包括单次交易的最大利润计算方法和允许多次交易的情况下的优化策略。

Say you have an array for which the i^th element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete at most two transactions.

Note:
You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

程序包含了Best Time to Buy and Sell Stock I和Best Time to Buy and Sell Stock II

#include<stdio.h>
//Best Time to Buy and Sell Stock I
int maxProfit(int *prices, int n) {
    int i = 0;
    int profit = 0, min = *prices;
    if(n == 0) return 0;
    
    for(i = 1; i < n; i++){
        if(*(prices + i) - min > profit) profit = *(prices + i) - min;
        if(*(prices + i) < min) min = *(prices + i);
    }
    printf("profit:%d\n", profit);
    return profit;
}
//Best Time to Buy and Sell Stock II
int maxProfitMulti(int *prices, int n) {
    int i, j, sum = 0;
    if(n == 0) return 0;
    for(i = 0 ;i < n - 1; i++ ) {
        if(prices[i + 1] > prices[i]) {
            for(j = i; j < n - 1 && prices[j] < prices[j + 1]; j++);
            if(j != i ) {
                sum += prices[j] - prices[i];
                //printf("%d\n", sum);
            }
            i = j;
        }
    }
    return sum;

}
//Best Time to Buy and Sell Stock III
int maxProfitTow(int *prices, int n) {
    int i, max = 0, profit = 0;
    if(n == 0) return 0;
    for(i = 1 ;i < n; i++ ) {
        if(pricess[i] <= pricess[i - 1]) continue;
        profit = maxProfit(prices, i + 1) + maxProfit(prices + i + 1, n - i - 1);
        if(profit > max) max = profit;
    }
    return max;
}

void main() {
    int prices[] = {1,2,4,2,5,7,2,4,9,0};
    int n = 10;
    printf("%d\n", maxProfitTow(prices, n));
}