c++ leetcode 算法题 Best Time to Buy and Sell Stock II

Best Time to Buy and Sell Stock II

 Total Accepted: 30687 Total Submissions: 83357My Submissions

Question Solution 

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

Hide Tags

 Array Greedy

代码：

class Solution {public:    int maxProfit(vector<int> &prices) {        if (prices.size() <= 1)            return 0;        size_t max_profit = 0;        int min_price=prices[0],max_price=0,pro_d;        bool tt=false;        for (size_t i = 1; i < prices.size(); ++i)        {            pro_d = prices[i]-prices[i-1];            if(pro_d>0)            {                max_price = prices[i];                tt = true;            }else            {                min_price = prices[i];                            }            if(tt==true)            {                tt=false;                max_profit += (max_price-min_price);                min_price = prices[i];            }        }                return max_profit;    }};

想明白开始是上市趋势还是下降趋势，然后每次计算利率的点。