122. Best Time to Buy and Sell Stock II [LeetCode]

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

题目要求：给定一份一段时间内的股价表。在此时间内，可以进行任意的买卖，求最大获利。其中，每一次卖都必须要在买之后。

分析一下，这是一个很简单的贪心算法。只要出现，某一日的股价比前一日高，即可以把该差价纳入最大收益中去。而不论在前面一日的股价是多少。

具体实现的java代码如下：

public class Solution {
    public int maxProfit(int[] prices) {
        int len = prices.length;
        int max = 0;
        for (int i=0; i
        
        
         
          0)
                max += x;
        }
        return max;
    }
}