LeetCode——122. Best Time to Buy and Sell Stock II

题目：

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

分析：写一个算法进行股票交易，数组代表每天的股票价格，可以多次进行买卖，但是买之前必须先卖出，核心思想，对区间增量进行累加。

代码如下：

public class Solution {
    public int maxProfit(int[] prices) {
        if(prices == null || prices.length < 2) return 0;
        int buy = prices[0];
        int result = 0;
        for(int i = 1;i<prices.length;i++){
            if(buy < prices[i]){
               result += prices[i] - buy;//每次增量累加
                buy = prices[i];
            }else{
                buy = prices[i];
            }
        }
        return result;
    }
}