Leetcode_C++笔记之122. Best Time to Buy and Sell Stock II（买卖股票的最佳时机II）

JayShaun

已于 2022-11-29 09:53:46 修改

阅读量379

点赞数

文章标签：算法数据结构

于 2022-11-16 09:46:40 首次发布

本文链接：https://blog.csdn.net/m0_37864814/article/details/127878611

版权

leetcode笔记专栏收录该内容

16 篇文章 0 订阅

订阅专栏

本文探讨了如何利用动态规划和贪心策略解决LeetCode中的股票买卖问题（BestTimetoBuyandSellStockII）。通过实例演示，学习者将理解如何在给定股票价格数组中找到买入和卖出股票以获取最大利润的方法。两种算法思路对比及代码实现详解有助于提升算法理解和实战技巧。

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

题目名称

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.

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 * 104
0 <= prices[i] <= 104

初试思路

这个题之前做过的，但是忘记了。链接：
leetcode(c++)-买卖股票的最佳时机 II
1、动态规划；
2、贪心算法求上升区间高度和。

初试代码

// 我的代码1
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int dp0 = 0;
        int dp1 = -prices[0];
        int tmp;
        for (int i=1; i<size(prices); i++){
            tmp = dp0;
            dp0 = max(dp0, prices[i]+dp1);
            dp1 = max(dp1, dp0-prices[i]);
        }
        return dp0;
    }
};

// 我的代码2
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int sum = 0;
        for(int i = 0; i+1 < size(prices); i++){
            if (prices[i+1] > prices[i])
                sum += prices[i+1] - prices[i];
        }
        return sum;
    }
};