Best Time to Buy and Sell Stock II

最新推荐文章于 2025-08-09 17:01:50 发布

原创最新推荐文章于 2025-08-09 17:01:50 发布 · 326 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #leetcode #贪心

LeetCode 专栏收录该内容

161 篇文章

订阅专栏

本文介绍了一种利用贪心算法解决股票交易中如何获得最大利润的问题。通过不断寻找价格上升区间来累积最大收益。

摘要生成于 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).

二、思路

采用贪心算法。求最大的收益，不论你交易几次，只要求出最大收益和即可。

三、代码

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