Leetcode:买股票，可多次交易，求可获得的最大利润.

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

假设有一个数组，其中第i个元素是某只股票在第i天的价格。

设计一个算法来寻找最大的利润。您可以完成任意数量的交易(例如，多次购买和出售股票的一股)。但是，您可能不会同时进行多个交易(即，您必须在再次购买之前卖出股票)。

 

思路：相邻两天的股票价格如果是递增关系，第一天买入，第二天就卖出，这样可以得到累积获得的利润最大

Java代码实现

public class Solution {
//相邻两天的股票价格如果是递增关系，就第一天买入，第二天就卖出，这样可以得到累积获得的利润最大
    public int maxProfit(int[] prices) {
        if(prices.length < 2)
            return 0;
        int max_profit = 0;
        int buy = prices[0];
        for(int i = 1; i < prices.length; i++){
            if(prices[i] > buy){
                max_profit += prices[i] - buy;
            }
            buy = prices[i];
        }
        return max_profit;
    }
}