122 - Best Time to Buy and Sell Stock II

最新推荐文章于 2022-04-20 11:05:21 发布

绿水兰田

最新推荐文章于 2022-04-20 11:05:21 发布

阅读量112

点赞数

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/LvShuiLanTian/article/details/95601298

版权

leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

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 (i.e., buy one and sell one share of the stock multiple times).

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

Example 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.

Example 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 cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

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

Code

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int num = prices.size(), pre[num], val[num];
        pre[0] = -1;
        val[0] = 0;
        for (int i = 1; i < num; ++i) {
            pre[i] = -1;
            val[i] = 0;
            for (int j = i - 1; j != -1; j = pre[j]) {
                if (prices[j] < prices[i]) {
                    pre[i] = j;
                    val[i] = prices[i] - prices[j] + val[j];
                    break;
                }
            }
            if (val[i] < val[i - 1]) {
                val[i] = val[i - 1];
            }
            //cout << i << " " << val[i] << endl;
        }
        return val[num - 1];
        
    }
};