[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) {
        int profit = 0;
        for (int i = 1; i < prices.size(); ++i) {
            if (prices[i-1] < prices[i]) {
                profit += (prices[i] - prices[i - 1]);
            }
        }
        return profit;
    }
};