LeetCode 30 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 may transaction as you like(ie, buy one and sell one share of the stock multiple times). However, yuo 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 <= 1)            return 0;        int max = 0;        for(int i=1; i<prices.length; i++)            if(prices[i] > prices[i-1])                max += (prices[i] - prices[i-1]);        return max;    }}