Best Time to Buy and Sell Stock

最新推荐文章于 2022-07-29 20:36:59 发布

pantingting_

最新推荐文章于 2022-07-29 20:36:59 发布

阅读量358

点赞数 1

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/pantingting_zju/article/details/50811071

版权

leetcode 专栏收录该内容

25 篇文章 0 订阅

订阅专栏

Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the maximum profit.

分析：某一天i的最大收益应该是是i这天与前面i-1天中最小值的差值，所以我们只要一路记录i之前的最小值就好了，我们用dp[i]表示以i为结尾的子串中的最小数字。代码如下：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size()==0) return 0;
        int max = prices[0];//最大收益
        int *dp = new int[prices.size()];
        dp[0]=prices[0];//以i为结尾的前面的最小值
        for(int i =1;i<prices.size();i++){
            dp[i]=prices[i]<dp[i-1]?prices[i]:dp[i-1];
            max = prices[i]-dp[i-1]>max?prices[i]-dp[i-1]:max;
        }
        return max;
    }
};