122. Best Time to Buy and Sell Stock II

最新推荐文章于 2024-09-14 15:47:59 发布

milk_and_bread

最新推荐文章于 2024-09-14 15:47:59 发布

阅读量121

点赞数

分类专栏：刷题文章标签：数据结构

本文链接：https://blog.csdn.net/milk_and_bread/article/details/121249395

版权

刷题专栏收录该内容

3 篇文章 0 订阅

订阅专栏

该博客探讨了一个经典的计算机科学问题——在给定股票价格数组中寻找最大利润的买卖策略。通过递归遍历的方式，解释了如何在限制持有最多一股股票的情况下，找到最佳的买入和卖出时机。示例展示了在不同价格输入下的解决方案，并讨论了时间复杂度问题。

摘要由CSDN通过智能技术生成

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 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:

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:

<= prices.length <= 3 * 104 0 <= prices[i] <= 104

解决方案

一、递归遍历

时间复杂度n^n,数据量大后运行时间超时。

算法构建核心：

遍历所有情况
外层循环定义变量记录全局最优解，内层循环定义变量记录局部最优解
在满足后者大于起始的条件下，进入递归节点访问后者下个位置到整个列表的位置。

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