122. Best Time to Buy and Sell Stock II

最新推荐文章于 2024-01-03 12:56:44 发布

原创最新推荐文章于 2024-01-03 12:56:44 发布 · 964 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #数组 #贪心算法

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章

订阅专栏

算法/LeetCode

223 篇文章

订阅专栏

本文介绍了一种计算股票交易最大利润的算法。该算法允许进行多次买卖操作，但每次卖出后才能再次购买。通过遍历价格数组并抓住每一次上涨机会来累计总利润。

原题

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 int MaxProfit(int[] prices) {
        int totalProfit = 0;
        for(int i=0;i<prices.Length-1;i++)
        {
            if(prices[i+1]>prices[i])
               totalProfit += prices[i+1] - prices[i];
        }
        return totalProfit;
    }