LeetCode 122. Best Time to Buy a

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代码：

class Solution {
    public int maxProfit(int[] prices) {
        int maxBenefit = 0;
        for (int i = 0; i < prices.length - 1; i++) {
            if (prices[i + 1] - prices[i] > 0) {
                maxBenefit += prices[i + 1] - prices[i];
            }
        }
        return maxBenefit;

    }
}