LeetCode Top Interview Questions 122. Best Time to Buy and Sell Stock II (Java版; Easy)

welcome to my blog

LeetCode Top Interview Questions 122. Best Time to Buy and Sell Stock II (Java版; Easy)

题目描述

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

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
            Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
            Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
            engaging multiple transactions at the same time. You must sell before buying again.
Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

第一次做; 最优解; 但还是要掌握下面的状态图解法

class Solution {
    public int maxProfit(int[] prices) {
        //贪心; 考虑相邻两天的股价, 如果赚钱就买卖, 亏钱就不买卖
        //总收益
        int res = 0;
        //今天买明天卖的收益
        int cur = 0;
        for(int i=0; i<prices.length-1; i++){
            //核心: 连续上涨交易日, 等价于每天都买卖, 例子{1,3,5}, 应该是1入5出,收益为4, 等价于1入3出,3入5出,收益还是4; 把可能跨越多天的买卖都化解成相邻两天的买卖
            cur = prices[i+1] - prices[i];
            res = res + (cur>0?cur:0);
        }
        return res;
    }
}

第一次做; 必须会画状态转移图, 有了状态转换图就好做了

class Solution {
    public int maxProfit(int[] prices) {
        if(prices==null || prices.length==0)
            return 0;
        //
        int n = prices.length;
        //s0[i]表示第i天持有股票时的最大利润
        int[] s0 = new int[n];
        //s1[i]表示第i天不持有股票时的最大利润
        int[] s1 = new int[n];
        //initialize
        s0[0] = -prices[0];
        s1[0] = 0;
        //dp主体
        for(int i=1; i<n; i++){
            s0[i] = Math.max(s0[i-1], s1[i-1]-prices[i]);
            s1[i] = Math.max(s1[i-1], s0[i-1]+prices[i]);
        }
        return s1[n-1];
    }
}