Best Time to Buy and Sell Stock II

leetcode中的股票问题(2)

现在来讨论讨论第二题
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 <script type="math/tex" id="MathJax-Element-2">i</script>.

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).
翻译:有一个int类型数组，第i个元素表示股票在这一天的价格，如果允许你进行任意多手交易（在某天买入股票然后在之后的某一天卖掉股票），设计一种算法找出最大的收益。

问题分析

同样的，图不能少：

可以进行任意手交易，那么直观的感觉就是每一次股票涨价都要赚一把！
见图：

很直观扫一遍OK，代码就不写注释啦~~~

代码

public int maxProfit(int[] prices) {
    if(prices.length < 2)
    {
        return 0;
    }
    int sum = 0;
    for(int i = 0; i < prices.length - 1; i++)
    {
        sum += prices[i + 1] - prices[i] > 0 ? prices[i + 1] - prices[i] : 0;
    }
    return sum;
}

3、4可能有点难哟，接下来~