best-time-to-buy-and-sell-stock

Say you have an array for which the i th 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).

class Solution {
public:
    int maxProfit(vector<int> &prices) {
       if(prices.size()==0)
            return 0;
        if(prices.size()==1)
            return 0;
        int result=0;
    int lastbuy=0;
        int flag=0; //当前是否持股 
    int i;
    //先买第一股 顺序选择 价格比之后低的一天 
    for(i=0;i<prices.size()-1;i++){
        if(prices[i]<prices[i+1]){

            lastbuy=prices[i];
            flag=1;
            break;  
        }
    }
    //cout<<lastbuy<<endl;
    if(flag==0)
        return 0;
    //cout<<i<<endl;
    for(int j=i;j<prices.size();j++){

        //到最后一天 如果没卖必须处理 
        if(j==prices.size()-1){
            if(flag==1){
                result+=prices[j]-lastbuy;
                flag=0;
            }else{
                break;
            }
        }
        //第二天会跌 直接卖了 
        if(prices[j]>prices[j+1] && flag==1){
            result+=(prices[j]-lastbuy);
            flag=0;
        }
        //第二天会涨 当天没有股 买入 
        if(prices[j]<prices[j+1] && flag==0){
            lastbuy=prices[j];
            flag=1;
        }


    }

    return result; 
    }
};

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

Design an algorithm to find the maximum profit. You may complete at most two transactions.

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

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

Say you have an array for which the i th 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.

class Solution {
public:
    int maxProfit(vector<int> &prices) {
            int buy1=INT_MIN,sell1=0;
    for(int i=0;i<prices.size();i++){
        buy1=max(buy1,-prices[i]);
        sell1=max(sell1,buy1+prices[i]);
    }
    return sell1;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值