best-time-to-buy-and-sell-stock-ii leetcode C++

最新推荐文章于 2019-04-25 11:23:27 发布

原创最新推荐文章于 2019-04-25 11:23:27 发布 · 175 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #C #牛客网 #算法

算法同时被 3 个专栏收录

149 篇文章

订阅专栏

Algorithm

147 篇文章

订阅专栏

牛客网

146 篇文章

订阅专栏

本文介绍了一种计算股票交易最大利润的算法。该算法允许进行多次买卖操作，但每次卖出后才能再次购买。通过遍历价格数组并抓住每一次上涨机会来实现收益最大化。

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

C++

class Solution {
public:
    int maxProfit(vector<int>& prices){
        int res = 0;
        int n = prices.size() - 1;
        for (int i = 0; i < n; ++i){
            if (prices[i] < prices[i+1])
                res += prices[i + 1] - prices[i];
        }
        return res;
    }
};