【CODE】Best Time to Buy and Sell Stock

最新推荐文章于 2022-09-20 20:59:37 发布
最新推荐文章于 2022-09-20 20:59:37 发布
阅读量179 收藏
点赞数
分类专栏： C/C++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Li_Jiaqian/article/details/102823311
版权

Kadane's algorithm(Kadane算法)

  • 最大子数列
  • 两个变量:max_ending_here(将当前元素x强制作为最后一个元素)、max_so_far(遍历至当前元素时，最大的和)
int maxSubArray(vector<int> nums){
    int max_so_far=max_ending_here=nums[0];
    for(int i=0;i<nums.size();i++){
        max_ending_here=max(nums[i],max_ending_here+nums[i]);
        max_so_far=max(max_ending_here,max_so_far);
    }
    return max_so_far;
}
 121

Best Time to Buy and Sell Stock     

 48.6%Easy 
 122

Best Time to Buy and Sell Stock II    

 53.5%Easy 
 123

Best Time to Buy and Sell Stock III    

 35.2%Hard 
 188

Best Time to Buy and Sell Stock IV    

 27.1%Hard 
 309

Best Time to Buy and Sell Stock with Cooldown    

 45.0%Medium 
 714

Best Time to Buy and Sell Stock with Transaction Fee    

 52.1%Medium 

121. Best Time to Buy and Sell Stock

（最多一次交易）

Easy

3329149FavoriteShare

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 (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 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
Explanation: In this case, no transaction is done, i.e. max profit = 0.
  • 使用Kadane's algorithm(Kadane算法)思想：
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size()==0 || prices.size()==1) return 0;
        int max_ending_here=0,max_so_far=0;
        int min=prices[0];
        for(int i=1;i<prices.size();i++){
            if(prices[i]<min) min=prices[i];
            max_ending_here=max(prices[i]-min,0);
            max_so_far=max(max_so_far,max_ending_here);
        }
        return max_so_far;
    }
};
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size()==0 || prices.size()==1) return 0;
        int max_ending_here=0,max_so_far=0;
        for(int i=1;i<prices.size();i++){
            max_ending_here=max(max_ending_here+prices[i]-prices[i-1],0);
            max_so_far=max(max_so_far,max_ending_here);
        }
        return max_so_far;
    }
};
  • Runtime: 4 ms, faster than 98.18% of C++ online submissions for Best Time to Buy and Sell Stock.
  • Memory Usage: 9.4 MB, less than 100.00% of C++ online submissions for Best Time to Buy and Sell Stock.
  • 以下简单遍历：
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int res=0;
        if(prices.size()<=1) return res;
        int minn=prices[0],maxx=prices[prices.size()-1];
        for(int i=0;i<prices.size()-1;i++){
            if(minn>prices[i]) minn=prices[i];
            maxx=prices[i+1];
            for(int j=i+1;j<prices.size();j++){
                if(maxx<prices[j]) maxx=prices[j];
            }
            if(res<maxx-minn) res=maxx-minn;
        }
        return res;
    }
};
  • Runtime: 528 ms, faster than 12.39% of C++ online submissions for Best Time to Buy and Sell Stock.
  • Memory Usage: 9.5 MB, less than 83.49% of C++ online submissions for Best Time to Buy and Sell Stock.

122. Best Time to Buy and Sell Stock II

（可以多次交易）

Easy

13451439FavoriteShare

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 (i.e., buy one and sell one share of the stock multiple times).

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

Example 1:

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.

Example 2:

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.

Example 3:

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) {
        if(prices.size()<=1) return 0;
        int cash=0,hold=-prices[0];
        for(int i=1;i<prices.size();i++){
            cash=max(cash,hold+prices[i]);
            hold=max(hold,cash-prices[i]);
        }
        return cash;
    }
};

123. Best Time to Buy and Sell Stock III

Hard

142959FavoriteShare

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 at most two transactions.

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

Example 1:

Input: [3,3,5,0,0,3,1,4]
Output: 6
Explanation: Buy on day 4 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
             Then buy on day 7 (price = 1) and sell on day 8 (price = 4), profit = 4-1 = 3.

Example 2:

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.

Example 3:

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) {
        if(prices.size()<=1) return 0;
        int sell1=0,sell2=0,buy1=INT_MIN,buy2=INT_MIN;
        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;
    }
};
  • Runtime: 8 ms, faster than 71.89% of C++ online submissions for Best Time to Buy and Sell Stock III.
  • Memory Usage: 9.5 MB, less than 78.57% of C++ online submissions for Best Time to Buy and Sell Stock III.
  • Next challenges:
  • Best Time to Buy and Sell Stock IV
  • Maximum Sum of 3 Non-Overlapping Subarrays
  • 思路借鉴：https://blog.csdn.net/u012501459/article/details/46514309
  • 假设手上最开始只有0元钱，那么如果买入股票的价格为price，手上的钱需要减去这个price，如果卖出股票的价格为price，手上的钱需要加上这个price。
  • Buy1[i]表示前i天做第一笔交易买入股票后剩下的最多的钱；
  • Sell1[i]表示前i天做第一笔交易卖出股票后剩下的最多的钱；
  • Buy2[i]表示前i天做第二笔交易买入股票后剩下的最多的钱；
  • Sell2[i]表示前i天做第二笔交易卖出股票后剩下的最多的钱；
  • Sell2[i]=max{Sell2[i-1],Buy2[i-1]+prices[i]}
  • Buy2[i]=max{Buy2[i-1],Sell[i-1]-prices[i]}
  • Sell1[i]=max{Sell[i-1],Buy1[i-1]+prices[i]}
  • Buy1[i]=max{Buy[i-1],-prices[i]}
  • 另一种思路：
  • 定义A[i]为前i天赚的最大数目的钱，minPrice表示从0到第i-1天中的最低价格，因此：A[0]=0,A[1]=max(prices[1]-prices[0],A[0]),A[2]=max(A[1],prices[2]-minPrice),...,A[i]=max(A[i-1],prices[i]-minPrice).
  • 另一次从后往前扫描，定义B[i]表示从第i天到最后一天n能赚的最大数目的钱，maxPrice表示第i+1天到n天的最高价格，因此：B[n]=0,B[n-1]=max(B[n],maxPrice-prices[n-1]),B[n-2]=max(B[n-1],maxPrice-prices[n-2]),...,B[i]=max(B[i+1],maxPrice-prices[i]).
  • 那么以第i天为分割点能够赚的最多数目的钱为：A[i]+B[i]，转化为求解max{A[i]+B[i]},时间复杂度：O(n),空间复杂度：O(n).
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size()<=1) return 0;
        int n=prices.size(),res=0;
        vector<int> A(n,0),B(n,0);
        int minPrice=prices[0],maxPrice=prices[n-1];
        for(int i=1;i<n;i++){
            A[i]=max(A[i-1],prices[i]-minPrice);
            if(minPrice>prices[i]) minPrice=prices[i];
            B[n-i-1]=max(B[n-i],maxPrice-prices[n-i-1]);
            if(maxPrice<prices[n-i-1]) maxPrice=prices[n-i-1];
        }
        for(int i=0;i<n;i++){
            if(res<A[i]+B[i]) res=A[i]+B[i];
        }
        return res;
    }
};
  • Runtime: 8 ms, faster than 71.89% of C++ online submissions for Best Time to Buy and Sell Stock III.
  • Memory Usage: 9.8 MB, less than 35.71% of C++ online submissions for Best Time to Buy and Sell Stock III.

188. Best Time to Buy and Sell Stock IV

（最多k次交易）

Hard

98261FavoriteShare

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 k transactions.

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

Example 1:

Input: [2,4,1], k = 2
Output: 2
Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.

Example 2:

Input: [3,2,6,5,0,3], k = 2
Output: 7
Explanation: Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4.
             Then buy on day 5 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.

 

309. Best Time to Buy and Sell Stock with Cooldown

（可以多次交易，买完之后的第一天不能买进，成为cooldown）

Medium

164762FavoriteShare

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) with the following restrictions:

  • You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
  • After you sell your stock, you cannot buy stock on next day. (ie, cooldown 1 day)

Example:

Input: [1,2,3,0,2]
Output: 3 
Explanation: transactions = [buy, sell, cooldown, buy, sell]
class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size()<=1) return 0;
        int i=1,size=prices.size();
        vector<int> s0(size,0),s1(size,0),s2(size,0);
        s0[0]=0;s1[0]=-prices[0];s2[0]=INT_MIN;
        //s0：休息日，s1：持有，s2：卖掉（不持有）
        for(i=1;i<size;i++){
            s0[i]=max(s0[i-1],s2[i-1]);
            //休息日，要么是昨天刚卖掉（s2[i-1]），要么是和昨天一样没有交易（s0[i-1]）
            s1[i]=max(s0[i-1]-prices[i],s1[i-1]);
            //持有，要么是从休息日刚过来卖掉的（s0[i-1]-prices[i]），要么是和昨天一样没有交易（s1[i-1]）
            s2[i]=s1[i-1]+prices[i];
            //卖掉，下一个状态是s0
        }
        return max(s0[size-1],s2[size-1]);
    }
};

714. Best Time to Buy and Sell Stock with Transaction Fee

（可以多次交易，每次交易/卖出时有手续费，求买卖股票的最大收益）

Medium

110033FavoriteShare

Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.

You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.)

Return the maximum profit you can make.

Example 1:

Input: prices = [1, 3, 2, 8, 4, 9], fee = 2
Output: 8
Explanation: The maximum profit can be achieved by:
  • Buying at prices[0] = 1
  • Selling at prices[3] = 8
  • Buying at prices[4] = 4
  • Selling at prices[5] = 9
  • The total profit is ((8 - 1) - 2) + ((9 - 4) - 2) = 8.

     

    Note:

  • 0 < prices.length <= 50000.
  • 0 < prices[i] < 50000.
  • 0 <= fee < 50000.
class Solution {
public:
    int maxProfit(vector<int>& prices, int fee) {
        int cash=0,hold=-prices[0];
        //cash表示该天结束时，若未持有股票，手中的最大价值
        //hold表示该天结束时，若持有股票，手中的最大价值
        for(int i=1;i<prices.size();i++){
            cash=max(cash,hold+prices[i]-fee);
            //未持有股票：当天没买（cash）/ 当天刚卖（hold+prices[i]-fee）
            hold=max(hold,cash-prices[i]);
            //持有股票：当天没卖（hold）/ 当天刚买（cash-prices[i]）
        }
        return cash;
    }
};

 

Li_JiaQian
关注
专栏目录
t10_Adapting to Market Participantsand Conditions
Linli522362242的专栏
02-13 4141
So far, we've gone over all the concepts and ideas involved in algorithmic trading. We went from introducing the different components and players of an algorithmic trading ecosystem to going over practical examples of trading signals, adding predictiv...
【人工智能】机器学习的持续交付 （CD4ML）
最新发布
程序员光剑
04-29 1万+
机器学习的持续交付 自动化机器学习应用程序的端到端生命周期 机器学习应用程序在我们的行业中变得越来越流行，但是与更传统的软件（例如 Web 服务或移动应用程序）相比，开发、部署和持续改进它们的过程更加复杂。它们会在三个轴上发生变化：代码本身、模型和数据。他们的行为通常很复杂且难以预测，而且他们更难测试、更难解释、更难改进。机器学习持续交付 (CD4ML) 是将持续交付原则和实践引入机器学习应用程序的学科。
714. Best Time to Buy and Sell Stock with Transaction Fee
Do not mess it up
10-23 1436
Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.You may complete as many tr...
121. Best Time to Buy and Sell Stock
weixin_43550014的博客
09-17 121
121. Best Time to Buy and Sell Stock 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 (i.e., buy one and sell one share of the stock), design an algorithm
leecode 149. Best Time to Buy and Sell Stock
Ding 的博客
09-12 172
149. Best Time to Buy and Sell Stock Description 假设有一个数组，它的第i个元素是一支给定的股票在第i天的价格。如果你最多只允许完成一次交易(例如,一次买卖股票),设计一个算法来找出最大利润。 Example 1 Input: [3, 2, 3, 1, 2] Output: 1 Explanation: You can buy at the thir...
Best Time to Buy and Sell Stock III 最佳时间买入卖出股票（最多两次买卖）@LeetCode
热门推荐
11-08 2万+
直到要用DP做，但是一开始思路是错的。后来参考了 http://blog.csdn.net/pickless/article/details/12034365 才意识到可以在整个区间的每一点切开，然后分别计算左子区间和右子区间的最大值，然后再用O(n)时间找到整个区间的最大值。 看来以后碰到与2相关的问题，一定要想想能不能用二分法来做！ 下面复制pickless的讲解，我觉得我不能比
[LeetCode ] Best Time to Buy and Sell Stock系列题解
GYH0730的博客
11-24 384
这一系列的题目的基本模型是给出n天每天股票的价格，可以在任意一天买股票，在之后的任意一天把股票卖出，赚取差价，限制是手中最多有一张股票，必选把手中的股票卖掉才能再买股票。求最大获利。 题目1：Best Time to Buy and Sell Stock 这是最简单的一道题，在基本模型的基础上添加了一个限制条件，最多交易一次。 我们从第一天开始遍历，维护一个已经遍历过的股票的最小价格mi...
【Machine Learning Time Series Forecasting: From Beginner to Expert】: Mastering Core Applications
# [Machine Learning Time Series Forecasting: From Beginner to Expert, Mastering Core Applications](https://***/167ae4fd6205b00d002cd00dbedee4fb0421d60c/e4f89/images/time-series-vectors-1.png) ...
【ISE3002: Planning of Production and Service Systems】
m0_66706847的博客
09-20 645
Planning of Production and Service Systems学习笔记。
【CODE】01 矩阵（01 Matrix）
Li_Jiaqian的博客
04-15 2135
542. 01 矩阵 难度中等192收藏分享切换为英文关注反馈 给定一个由 0 和 1 组成的矩阵，找出每个元素到最近的 0 的距离。 两个相邻元素间的距离为 1 。 示例 1: 输入: 0 0 0 0 1 0 0 0 0 输出: 0 0 0 0 1 0 0 0 0 示例 2: 输入: 0 0 0 0 1 0 1 1 1 输出: 0 0 0 0 1 0 1 2 ...
【CODE】nSum问题
Li_Jiaqian的博客
03-02 1173
目录 1.Two Sum 15.3Sum 16.3Sum Closest 259. 3Sum Smaller 923.3Sum With Multiplicity 18.4Sum 454.4Sum II 1.Two Sum Easy 13693502Add to ListShare Given an array of integers, returnindi...
【CODE】Top Interview Questions && 并查集
Li_Jiaqian的博客
03-12 1061
目录 78.Subsets 90.Subsets II 825.Friends Of Appropriate Ages 230.Kth Smallest Element in a BST 48.Rotate Image 49.Group Anagrams 328.Odd Even Linked List 725.Split Linked List in Parts ...
【CODE】CoderPad——单链表
Li_Jiaqian的博客
02-14 1016
1.单链表反转 #include<iostream> #include<stdlib.h> using namespace std; typedef struct ListNode{ int value; ListNode *next; }ListNode; void print(ListNode *head){ while(head!=NULL){ ...
【CODE】二分查找 && 二维矩阵问题 && 螺旋矩阵 && 中位数
Li_Jiaqian的博客
03-04 1002
目录 475.Heaters 441.Arranging Coins 363.Max Sum of Rectangle No Larger Than K 240.Search a 2D Matrix II 74.Search a 2D Matrix 54.Spiral Matrix 59.Spiral Matrix II 73.Set Matrix Zeroes ...
【CODE】CoderPad——树
Li_Jiaqian的博客
02-20 933
目录 1.递归层序/先序/中序/后序遍历二叉树 2.非递归先序/中序/后序遍历二叉树 3.递归/非递归产生二叉树的镜像 4.二叉树叶子节点个数/二叉树第k（从1开始）层节点数 5.树的高度 6.二叉树的最小深度 7.判断是否是完全二叉树 8.判断两个数是否相同/是否互为镜像 9.判断一个树是否是另一个树的子树 10.二叉树中两节点间最长距离 11.判断是否是二叉搜索树 12...
【综合】一些春招实习面经和碎碎念
Li_Jiaqian的博客
04-03 822
写在前面的话。 C++，两年半专硕，投了好些家，完结撒花，专心搞毕设了。（牛客真的蛮灵，3月27日发了第一篇面经后，开始变得顺起来）（大伙不要喷我，我的本意不是“面霸”，只是希望有位爸爸能够收留） B站 2020/1/3-电话面 用户态和内核态的区别 用户态和内核态切换的代价 环形缓冲区的好处 如果多个用户读同一个缓存环 互斥锁 TCP四次挥手 Alloc，c语言内存管理 S...
【CODE】滑动窗口的最大值 & 最大子序和
Li_Jiaqian的博客
05-03 748
滑动窗口的最大值 给定一个数组和滑动窗口的大小，找出所有滑动窗口里数值的最大值。例如，如果输入数组{2,3,4,2,6,2,5,1}及滑动窗口的大小3，那么一共存在6个滑动窗口，他们的最大值分别为{4,4,6,6,6,5}； 针对数组{2,3,4,2,6,2,5,1}的滑动窗口有以下6个： {[2,3,4],2,6,2,5,1}， {2,[3,4,2],6,2,5,1}， {2,3,[4,2,6...
【CODE】设计推特（Design Twitter）
Li_Jiaqian的博客
04-13 718
355. 设计推特 难度中等72收藏分享切换为英文关注反馈 设计一个简化版的推特(Twitter)，可以让用户实现发送推文，关注/取消关注其他用户，能够看见关注人（包括自己）的最近十条推文。你的设计需要支持以下的几个功能： postTweet(userId, tweetId): 创建一条新的推文 getNewsFeed(userId): 检索最近的十条推文。每个推文都必须是由此用户关注的人...
Write a few line code to download data for 1 stock
04-18
Sure, here's a Python code snippet to download historical data for a single stock using the pandas-datareader library: ```python import pandas_datareader.data as web # specify the stock ticker and ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值