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

这道题与121题类似，只是本题可做多次交易，求出最大利润，当当天的价格比前一天的高时即可抛出，以此可得到最大利润，代码如下：

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

初次运行结果是击败了68%的提交结果，但是当我加了int len  = prices.length时，结果变为10%左右==我也不清楚为什么==