BestTimeToBuyAndSell 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 BestTimeToBuyAndSellII {    public int maxProfit(int[] prices) {        int profit = 0;        for(int i=1; i<prices.length; i++) {                profit = profit + Math.max(prices[i]-prices[i-1], 0);        }        return profit;    }}