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

Analysis: Find each ascending interval. Pay attention that the value of temp needs to added up in the end of the iteration. 

public class Solution {    public int maxProfit(int[] prices) {        if(prices.length==0) return 0;                    int profit=0, start=0, temp=0;        for(int i=1; i<prices.length; i++) {            if(prices[i]-prices[start]>temp) temp=prices[i]-prices[start];            else if(prices[i]-prices[start]<temp) {                profit += temp;                temp = 0;                start = i;            }            if(i==prices.length-1) profit+=temp;     // ASC order till the end        }        return profit;    }}