#leetcode# Best Time to Buy and Sell Stock II

最新推荐文章于 2025-04-18 22:24:21 发布

原创最新推荐文章于 2025-04-18 22:24:21 发布 · 273 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#动态规划 #好题

本文介绍了一种计算股票交易最大利润的算法。该算法通过计算每日价格差额并累加所有正向差额来确定最佳买卖时机，允许进行多次买卖但不能同时持有多个股票。

题目：

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

思路：

先得到b[i] = a[i] - a[i - 1]的这个数组, 然后问题就可以转换为每天要不要取 b[i] 这个数字了~~~

代码:

int maxProfit(vector<int>& prices) {
        int n = prices.size();
        int ret = 0;
        for(int i = 1;i < n;i ++) {
            int add = prices[i] - prices[i - 1];
            if(add > 0) {
                ret += add;
            }
        }
       return ret;
    }