你的位置:首页 > Java教程

[Java教程][LeetCode] 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).

 

     这道题要注意几点。首先profit算的是累积的,不是单个最大的。

     然后就是题目上说了的,买股票之前必须要把股票卖完。所以说就不存在,只卖出一部分的情况。

     这样来说的话,其实算法比之前算单个max值的还要简单一点。

     代码如下。~

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