关闭

Leetcode 之 Best Time to Buy and Sell StockI,II

标签: leetcode
213人阅读 评论(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.

给一组时间序列的数据,如(1,2,4),先买后卖,求最大收益。这里是第一天买最后一天卖,收益是4-1=3。

同样用DP,f(n)代表第n天的最大收益。转移函数如下:

f(n) = Max( f(n-1), prof[i] - min[n])

其中,prof[n]是第n天股票的价格,min[n]也是一个用DP构造出的数组,存放第n天及其之前的最小数,也就是应该买入时的价格。第一部分是不选择第n天的价格,第二部分是在第n天卖出,这两部分求最大收益即可。

代码如下:

    public int maxProfit(int[] prices) {
        int days = prices.length;
        if(days == 0)   return 0;
        int[] maxPro = new int[days];
        int[] min = new int[days];

        for(int i = 0;i < days;i++){
            if(i == 0){
                maxPro[0] = 0;
                min[0] = prices[0];
            }
            else if(i == 1){
                int r = prices[1] - prices[0]; 
                if(r < 0){
                    maxPro[1] = 0;
                }
                else{
                    maxPro[1] = r;
                }   
                min[1] = Math.min(prices[0], prices[1]);
            }
            else{
                min[i] = Math.min(min[i - 1], prices[i]); 
                maxPro[i] = Math.max(maxPro[i - 1], prices[i] - min[i]);
            }
        }

        return maxPro[days - 1];
    }

198 / 198 test cases passed.
Status: Accepted
Runtime: 368 ms


Best Time to Buy and Sell Stock II
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 (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

II就允许多次交易了,其实类似贪心的活动安排问题,原则就是尽可能多的进行交易,所以我们只需要比较第n天和第n+1天的price,如果大的话就进行交易即可。

代码如下:

public int maxProfit(int[] prices) {
        int maxPro = 0;
        for (int i = 1;i < prices.length;i++){
            if(prices[i] > prices[i - 1]){
                maxPro += prices[i] - prices[i - 1];
            }
        }

        return maxPro;
    }

198 / 198 test cases passed.
Status: Accepted
Runtime: 376 ms

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:46526次
    • 积分:1218
    • 等级:
    • 排名:千里之外
    • 原创:75篇
    • 转载:12篇
    • 译文:0篇
    • 评论:5条
    最新评论