LeetCode122—Best Time to Buy and Sell Stock II

股票买卖三兄弟之二

原题

Say you have an array for which the ith 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).

不限买卖次数，但是每天只能一次操作。

分析

这题就简单多了，既然不限买卖次数，那么只要第i+1天的价格比第i天的价格要高，这样就可以交易。

代码

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