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

给定一个数组，第i个元素代表第i天的股票的数值，我们要设计一个算法算取获得的最大利润，不能同时操作多个股票，每次购买前必须先售出。要确定最大的利润，只要保证在每次售出的时候价格都比购入的时候价格低就可以了，我们可以在同一天中购买和售出，所以说我们只要计算第i+1天价格是否比第i天高即可，如果是这样，则把当天的差价加入到利润中。遍历完整个数组之后，就是我们得到的最大利润

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