【leetcode】Best Time to Buy and Sell Stock II

原创于 2015-11-19 20:35:43 发布 · 441 阅读

0 ·

CC 4.0 BY-SA版权

练习同时被 3 个专栏收录

19 篇文章

订阅专栏

C++

14 篇文章

订阅专栏

算法

13 篇文章

订阅专栏

本文介绍了一种算法，用于在股票市场中寻找并利用价格波动实现最大利润。该算法允许无限次买卖股票，但每次交易后必须清空持股。通过分析价格序列，算法能够识别并累积所有上升趋势的收益。

摘要生成于 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) {
        int result = 0;
        int profit = 0;
        if (prices.size() < 2)
            return result;
        for (vector<int>::iterator it = prices.begin() + 1; it != prices.end(); ++it)
        {
            profit = *it - *(it-1);
            if (profit > 0)
                result += profit;
        }
        return result;
    }
};

Personal Note：

实际上就是求所有上升区段的幅度和。