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

思路：每一段递增区间的收益累加。

代码：

int maxProfit(vector<int> &prices)
{
    int length = prices.size();
    int profit = 0;
    for(int i = 1;i < length;i++)
    {
        if(prices[i] > prices[i-1])
            profit = profit + (prices[i] - prices[i-1]);
    }
    return profit;
}

版权声明：本文博主原创文章，博客，未经同意不得转载。