【Leetcode】Best Time to Buy and Sell Stock II in JAVA

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

这道题就是说给一个数组，在最低点买，在下一个高点卖，然后再找下一个最低点买，最高点卖……

thus，问题是何时到最后break这个函数，我的办法模拟这个，比较笨：

<span style="white-space:pre">	</span>public class bestTimeBuynSellStock {
	public static void main(String args[]){
	bestTimeBuynSellStock bb = new bestTimeBuynSellStock();
	int[] p={2,1};// for test
	System.out.println("answer is:"+bb.maxProfit(p));
	}
	public int maxProfit(int[] prices) {
        int start;
        int end;
        int i=0;
        int account=0;
        if(prices.length<=1)    return 0;
        while(i<prices.length-1){
        	//System.out.println("round:"+i);
        while(prices[i]>=prices[i+1])	{
        	i++;
        	//System.out.println(i);
        	if(i==prices.length-1)	break;
        	}
        start = prices[i];
        if(i==prices.length-1)	return account;
        while(prices[i]<=prices[i+1])	{
        	i++;
        	//System.out.println(i);
        	if(i==prices.length-1)	break;
        }
        end = prices[i];
        account+=end-start;
	}
        return account;
	}
}