leetcode Best Time to Buy and Sell Stock II

Best Time to Buy and Sell Stock II

  Total Accepted: 22750  Total Submissions: 61772 My Submissions

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

Have you been asked this question in an interview? 

Discuss


这个就是求所有上升区间的最大差的和,下降的区间就不用管了,每一个上升区间都进行一次收益累加。

//9:07 from the valley bottom to the summit, just count the height difference.

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int res = 0,i,n = prices.size();
        if(prices.size()<2)
        {
            return res;
        }
        int lowStart = prices[0],tmpRes =0;
        int up = 0;//up为1处于上升区域。up为零,处于下降区域,处理好山坡和山谷临界点上的价格
        for(i=1;i<n;i++)
        {
            
            if(prices[i]>prices[i-1])
            {
                if(up==0)
                {
                    up = 1;
                    lowStart = prices[i-1];
                }
            }else if(prices[i]<prices[i-1])
            {
                if(up==1)
                {
                    up = 0;
                    tmpRes = prices[i-1] - lowStart;
                    res += tmpRes;
                }
            }
        }
        //遗留的状态
        if(up==1)
        {
            res += (prices[n-1] - lowStart);
            up = 0;
        }
        return res;
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值