LeetCode 122. Best Time to Buy and Sell Stock II

描述

给出一支股票在每天的价格，求在允许多次交易的情况下可以获得的最大收益

解决

记录当前天的最小值，遇到比当前天价格高的就卖出，然后重新买入，买入之前先卖出。

class Solution {public:    int maxProfit(vector<int>& prices) {        int lenth = prices.size();        int tmp = 0x3f3f3f, res = 0;        for (int i = 0; i < lenth; ++i){            if (prices[i] <= tmp){                tmp = prices[i];            }            else if (prices[i] > tmp){                res += prices[i] - tmp;                tmp = prices[i];            }        }        return res;    }};