122. Best Time to Buy and Sell Stock II

#week15

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