LeetCode121. 买卖股票的最佳时机

题目：

给定一个数组，它的第 i 个元素是一支给定股票第 i 天的价格。如果你最多只允许完成一笔交易（即买入和卖出一支股票），设计一个算法来计算你所能获取的最大利润。注意你不能在买入股票前卖出股票。

思路：

动态规划

题解：

一、动态规划（c++）
 

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int len = prices.size();
        if(len<2){
            return 0;
        }
        int diff = 0;
        int min = prices[0];
        int max = prices[0];
        
        vector<int> dp(len);
        
        dp[0] = 0;

        for(int j = 1; j<len; j++){
            diff = prices[j] - min;
            dp[j] = (dp[j-1] > diff)? dp[j-1]:diff;
            min = (min<prices[j])?min:prices[j];
        }
        return dp[len-1];
        
    }
};

二、python

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        if len(prices) < 2 :
            return 0
        else:
            min = prices[0]
            max = prices[0]
            diff = 0
            for i in range(1, len(prices)):
                if prices[i] > max:
                    max = prices[i]
                    if max - min > diff:
                        diff = max - min
                elif prices[i] < min:
                    min = prices[i]
                    max = prices[i]
            return diff