121. Best Time to Buy and Sell Stock& 122. 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.

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.

Example 1:

Input: [7, 1, 5, 3, 6, 4]
Output: 5

max. difference = 6-1 = 5 (not 7-1 = 6, as selling price needs to be larger than buying price)

Example 2:

Input: [7, 6, 4, 3, 1]
Output: 0

In this case, no transaction is done, i.e. max profit = 0.

Subscribe to see which companies asked this question


第一题,用kadane算法,和寻找最大子串和是一个思路。对于这道题来讲,原始串就是每个prices和它之前的prices的差。

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        
        int cur=0,soFar=0;
        
        for(int i=1;i<prices.size();i++){
            cur=max(0, cur+prices[i]-prices[i-1]);
            soFar=max(cur, soFar);
        }
        
        return soFar;
    }
};

第二题是进阶版

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).

leetcode上有段分析很好。

suppose the first sequence is "a <= b <= c <= d", the profit is "d - a = (b - a) + (c - b) + (d - c)" without a doubt. And suppose another one is "a <= b >= b' <= c <= d", the profit is not difficult to be figured out as "(b - a) + (d - b')". So you just target at monotone sequences.

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        
        int total=0;
        for(int i=1;i<prices.size();i++)
            total+=max(prices[i]-prices[i-1],0);
        
        return total;
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值