122. Best Time to Buy and Sell Stock II

解法一：

public class Solution {    public int maxProfit(int[] prices) {        if (prices.length<2)     return 0; int sumProfit = 0,startIndex = 0; for (int i = 1; i < prices.length; i++) {if (prices[i]>prices[i-1]) {sumProfit = sumProfit+prices[i]-prices[i-1];}}     return sumProfit;    }}