Leetcode Problem122

43 篇文章 0 订阅

Best Time to Buy and Sell Stock II

问题描述:这一题跟上一道题Best Time to Buy and Sell Stock很像,只是这道题允许多次买卖股票,但值得注意的是,你不能同时参与多笔交易,即必须在再次购买前出售掉之前的股票。

example1:


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

example2


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

example3:


  • 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(vector<int>& prices) {
        int len=prices.size(),profit=0;
        for(int i=1;i<len;i++)
        {
            //买入价格比卖出价格低
            if(prices.[i-1]<prices[i])
                profit+=prices[i]-prices[i-1];
        }
        return profit;
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值