122. Best Time to Buy and Sell Stock II

最新推荐文章于 2025-09-06 17:22:57 发布

原创最新推荐文章于 2025-09-06 17:22:57 发布 · 249 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #C++

LeetCode刷题笔记专栏收录该内容

126 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定股票价格序列时的最大可能利润。该算法允许进行多次买入卖出操作，前提是每次交易之间不能重叠。通过遍历价格数组并累加每次价格上涨的差额来计算总利润。

题目：Best Time to Buy and Sell Stock II

原题链接：https://leetcode.com/problems/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).
给定一个数组，第 i 个元素是股票在第 i 天的价格（i == 0是初始所持有的股票价格），请设计算法实现最大的利润。（可以把股票抛出和买进多次，但是一次只能进行一种操作）

这个题目很无聊。。。只要等到股票上涨到最高点抛掉就行= =
代码如下：

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