Best-time-to-buy-and-sell-stock-ii

最新推荐文章于 2020-06-27 13:15:44 发布

原创最新推荐文章于 2020-06-27 13:15:44 发布 · 233 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种用于计算股票交易中最大利润的算法。该算法允许进行多次买卖操作，但规定了每次卖出后才能再次购买的基本规则。通过遍历价格数组并累加每个上升趋势的差价来实现。

题目描述

Say you have an array for which the i th 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).

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

use the dynamic programming.