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

-思路-
哦嚯又来炒股了……每次都要从上帝视角解决炒股问题
这道题因为股票可以再同一天买入卖出，所以只要第二天的价格比第一天高就直接卖，想象你第二天发现涨价了，可以随时穿越回前一天买好股票然后在今天卖出去，总之就是有得赚就赚的思想。

-代码-

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size() < 2) return 0; 

        int max_pro = 0; 
        for(int i = 1; i < prices.size(); i++) {
            int diff = prices[i]-prices[i-1]; 
            if(diff > 0) 
                max_pro += diff; 
        }
        return max_pro; 
    }
};