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