【leetcode】 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).

问题解析：

假设给定一个数组：1,4,6,5,4,9,3。我们只要找到这样的数字：  此数字小于前一个，那么很有可能出现一笔交易。而另一种可能就是5,4之中类型的。没有出现。而1,4,6,5这种，5之前明显出现一次交易。如何区分这两种情况呢？

很简单。设立一个最小值变量min。和前一个变量cur。

1.设置min。cur都为prices[0]； 如果发现数组prices[i]>cur,那么cur=prices[i],并且i++;

2.如果prices[i]<cur，说明出现了交易。算出收益。然后continue

3.如果prices[i]<min了，说明min和cur都要设置为iprices[i]；

注意2.3的顺序不能颠倒。

AC代码如下：

public int maxProfit(int[] prices) {
        if(prices==null||prices.length==0)
        	return 0;
        int profit = 0;
        int min = prices[0];
        int cur = min;
        for(int i=1;i<prices.length;i++){
        	if(cur<=prices[i])
        		cur=prices[i];
        	if(prices[i]<cur){
        		profit=cur-min+profit;
        		min=prices[i];
        		cur=prices[i];
        		continue;
        	}
        	if(prices[i]<min){
        		min=prices[i];
        		cur=prices[i];
        		continue;
        	}
        	
        }
        if(cur>min){
        	profit+=cur-min;
        }
        return profit;
    }