LeetCode动态规划买卖股票的最佳时机

最新推荐文章于 2024-09-01 14:20:18 发布

江南路漫

最新推荐文章于 2024-09-01 14:20:18 发布

阅读量126

点赞数

分类专栏： LeetCode 动态规划

本文链接：https://blog.csdn.net/ucler/article/details/119269806

版权

LeetCode 同时被 2 个专栏收录

34 篇文章 0 订阅

订阅专栏

动态规划

21 篇文章 0 订阅

订阅专栏

本文解析如何使用动态规划解决投资问题，通过状态转移方程 dp[i]=min(dp[i-1], prices[i]) 计算股票交易中的最大利润，边界条件为 dp[0]=prices[0]。代码实例展示了如何实现这一算法来寻找最优买卖时机。

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

You are given an array prices where prices[i] is the price of a given stock on the ith day.
You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.
Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

状态转移方程
dp[i] = min(dp[i-1], prices[i])

边界条件
dp[0] = prices[0]

代码

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int len = prices.size();
        int dp[100005] = {0};
        dp[0] = prices[0];
        int maxn = 0;

        for(int i = 1; i < len; i++)
        {
            dp[i] = min(dp[i-1], prices[i]);
            if(prices[i] -dp[i-1] > maxn)
            maxn = prices[i] -dp[i-1];
        }
        return maxn;
    }
};