Leetcode/Bloomberg -- 122. Best Time to Buy and Sell Stock II(Greedy)

122. Best Time to Buy and Sell Stock II(Greedy)

• Difficulty: Medium

https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

Say you have an array for which the i^th 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).

思路：每一步涨的都加入结果，则会得到最大的收益。
关键字： Greedy

 

public class Solution {
    public int maxProfit(int[] prices) {
        /* greedy: get profit every increase, then you can get the total max profit;*/
        int res = 0;
        for(int i=1;i<prices.length;i++){
            if(prices[i]-prices[i-1]>0) res+=prices[i]-prices[i-1];//increase
        }
        return res;
    }
}