Java [Leetcode 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).

解题思路：

遇到后天比前一天高的，就把差值相加，累计相加最后得到结果。

代码如下：

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

　　

 

转载于:https://www.cnblogs.com/zihaowang/p/5247762.html