[LeetCode]106. Best Time to Buy and Sell Stock II股票买卖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不同的是，本题没有限制股票的买卖次数。贪心法，比较相邻两天的股票价格，只要价格上涨，则卖出股票。

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