【Array】【动态规划】121. 买卖股票的最佳时机Best Time to Buy and Sell Stock

class Solution {
    public int maxProfit(int[] prices) {
        //动态规划
        //d[i] = 第i天的最大利润
        //d[i] = max(d[i-1] , d[i -1] + prices[i] - prices[i-1])
        //d[0] = 0

        int min = prices[0];
        int[] dp = new int[prices.length];
        dp[0] = 0;
        for(int i = 1; i < prices.length; i ++){
            min = Math.min(min, prices[i]);
            dp[i] = Math.max(dp[i-1], prices[i] - min);
            System.out.println("i = "+ i + " dp[i] = " + dp[i]);
        }
        return dp[prices.length-1];
    }
}

简单的买卖股票问题，我用了动态规划！