买卖股票的最佳时机

题源：leetcode

链接：https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/

 

 采用动态规划

dp[i]=max(dp[i−1],prices[i]−minprice)

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n = prices.size();
        if (n == 0) return 0; // 边界条件
        int minprice = prices[0];
        vector<int> dp (n, 0);

        for (int i = 1; i < n; i++){
            minprice = min(minprice, prices[i]);
            dp[i] = max(dp[i - 1], prices[i] - minprice);
        }
        return dp[n - 1];
    }
};