[LeetCode] 009: Best Time to Buy and Sell Stock II

最新推荐文章于 2022-07-29 20:36:59 发布

1.02^365的成长裂变

最新推荐文章于 2022-07-29 20:36:59 发布

阅读量3.5k

点赞数

分类专栏： LeetCode2

本文链接：https://blog.csdn.net/raojunyang/article/details/77925103

版权

LeetCode2 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

[Problem]

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 as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

[Analysis]
找出每一个递增区间，累加所有递增区间的递增和。

[Solution]

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int minPrice = INT_MAX, profit = 0;
        for(int i = 0; i < prices.size(); ++i){
            // initial the minPrice
            if(i == 0){
                minPrice = prices[i];
            }
            else{
                // increasing
                if(prices[i] >= prices[i-1]){
                    minPrice = min(minPrice, prices[i]);
                }
                // descrease
                else{
                    profit += prices[i-1] - minPrice;
                    minPrice = prices[i];
                }
            }
        }
        
        // add the last increasing stock
        if(prices.size() > 0){
            profit += prices[prices.size()-1] - minPrice;
        }
        return profit;
    }
};