LeetCode 122: Best Time to Buy and Sell Stock II

最新推荐文章于 2022-07-29 20:36:59 发布

原创最新推荐文章于 2022-07-29 20:36:59 发布 · 464 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #greedy

leetcode 专栏收录该内容

91 篇文章

订阅专栏

本文介绍了一种贪心算法解决无限交易次数的股票买卖问题。通过从前向后遍历数组，仅在股价上涨时计入收益，实现最大化利润。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Best Time to Buy and Sell Stock II

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

解题思路

贪心法（greedy），从前向后遍历数组，只要当天的价格高于前一天的价格，就算入收益。代码如下：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int maxP = 0;
        for (int i = 1; i < prices.size(); ++i) {
            if (prices[i] >= prices[i-1]) {
                maxP += (prices[i] - prices[i-1]);
            }
        }
        return maxP;
    }
};