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