第五周：[Leetcode]122. Best Time to Buy and Sell Stock II

最新推荐文章于 2024-03-18 10:59:42 发布

原创最新推荐文章于 2024-03-18 10:59:42 发布 · 211 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

算法专栏收录该内容

45 篇文章

订阅专栏

本文介绍了一种通过贪心算法实现的股票交易策略，该策略允许进行多次买卖以获得最大利润，前提是不能同时持有多个仓位。算法核心在于只要第二天股价比前一天高就买入并卖出，累计所有这些差价即为最大利润。

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

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

贪心算法：只要是隔天获利的，都做这笔交易。
例如：1，2，3，4，5的序列，（2-1）+（3-2）+（4-3）+（5-4）= 5 - 1；

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