【LeetCode 面试经典150题】122. Best Time to Buy and Sell Stock II 买卖股票的最佳时机II

122. Best Time to Buy and Sell Stock II

题目大意

You are given an integer array prices where prices[i] is the price of a given stock on the ith day.

On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.

Find and return the maximum profit you can achieve.

中文释义

给定一个整数数组 prices，其中 prices[i] 是第 i 天给定股票的价格。

在每一天，你可以决定买入和/或卖出股票。你在任何时候最多只能持有一股股票。然而，你可以在同一天买入后立即卖出。

找出并返回你能获得的最大利润。

Example

Example 1:

• Input: prices = [7,1,5,3,6,4]
• Output: 7
• Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
  Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
  Total profit is 4 + 3 = 7.

Example 2:

• Input: prices = [1,2,3,4,5]
• Output: 4
• Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
  Total profit is 4.

Example 3:

• Input: prices = [7,6,4,3,1]
• Output: 0
• Explanation: There is no way to make a positive profit, so we never buy the stock to achieve the maximum profit of 0.

Constraints

• 1 <= prices.length <= 3 * 10^4
• 0 <= prices[i] <= 10^4

解题思路

算法描述

这段代码的目的是计算给定股票价格数组中可以实现的最大利润，允许多次买卖。
只要是前一天的股价比后一天的股价更低，那么增长的部分就是所能获得的利润。
算法的主要步骤如下：

1. 初始化变量:

   • max_profits: 用于累积所有可获得的利润，初始设置为0。

2. 遍历价格数组:

   • 从数组的第二个元素开始遍历。
   • 对于每一天，比较该天的价格与前一天的价格。
   • 如果当天价格高于前一天，即 prices[i] > prices[i - 1]，则表明存在利润，将这一天的利润加到 max_profits 上。
     • 这里的利润计算为 prices[i] - prices[i - 1]，即当天价格与前一天价格的差额。

3. 返回结果:

   • 遍历结束后，max_profits 中存储的是通过多次买卖可以获得的最大利润。

代码示例

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