LeetCode:Best Time to Buy and Sell Stock II

Best Time to Buy and Sell Stock II

Total Accepted: 68970 Total
Submissions: 171754 Difficulty: Medium

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个数表示第i天的股价。求最大收益。

思路：

数组后一项大于前一项即为单次交易的收益，所有交易之和即为最大收益。

code:

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