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

题意：给你一个数组，其中第i个元素代表第i天的股票的价格，设计一个算法去寻找最大利润值。你可以无限次的进行买卖。

思路：原来以为只是简单的比较数组之间的大小，结果怎么做都不对，参考了网上别人的做法，才发现审题错误了，获取最大利润，就是要获取每个元素之间的差值，因为可以进行无限次的买卖，所以可以将数组中元素的差值大于0的相加起来就是最大利润了。

class Solution {
    public int maxProfit(int[] prices) {
        if(prices==null||prices.length==0){
            return 0;
        }
        int result =0;
        for(int i=0;i<prices.length-1;i++)    // 注意长度要-1，不然下面的i+1会出现数组越界的情况！！
        {  
            int profit = prices[i+1]-prices[i];  
            if(profit >0)  
                result += profit ;  
        }  
        return result;
    }
}