leetcode第29题（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. 

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 == 0){
           return 0;
       }
        int global = 0;
        for(int i =1;i<prices.length;i++){
            if(prices[i]>prices[i-1]){
                global += prices[i]-prices[i-1];
            }
        }
        return global;
    }
}