[Leetcode] 121. Best Time to Buy and Sell Stock 解题报告
来源:互联网 发布:淘宝原图的定义 编辑:程序博客网 时间:2024/06/06 21:44
题目:
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: 5max. 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: 0In this case, no transaction is done, i.e. max profit = 0.
思路:
Easy级别的题目。我们记录一个截止当前日期的最低买入价,以及一个截止当前日期的最大获利,然后线性扫描数组,一旦发现当前卖出的获利大于最大获利值,则更新最大获利值;如果当前买入价小于最低买入价,则更新最低买入价。算法的时间复杂度是O(n),空间复杂度是O(1)。
代码:
class Solution {public: int maxProfit(vector<int>& prices) { if (prices.size() == 0) { return 0; } int lowest_price = prices[0]; int max_profit = 0; for (int i = 1; i < prices.size(); ++i) { if (prices[i] - lowest_price > max_profit) { max_profit = prices[i] - lowest_price; } if (prices[i] < lowest_price) { lowest_price =prices[i]; } } return max_profit; }};
0 0
- LeetCode-Best Time to Buy and Sell Stock-解题报告
- 【LeetCode】Best Time to Buy and Sell Stock 解题报告
- [leetcode] 121. Best Time to Buy and Sell Stock 解题报告
- Leetcode 121. Best Time to Buy and Sell Stock 股票买卖 解题报告
- [Leetcode] 121. Best Time to Buy and Sell Stock 解题报告
- [leetcode]解题报告121. Best Time to Buy and Sell Stock
- 【LeetCode】121.Best Time to Buy and Sell Stock解题报告
- 【LeetCode】 Best Time to Buy and Sell Stock I II III IV 解题报告
- LeetCode-Best Time to Buy and Sell Stock II-解题报告
- LeetCode-Best Time to Buy and Sell Stock III -解题报告
- LeetCode-Best Time to Buy and Sell Stock IV -解题报告
- 【LeetCode】 Best Time to Buy and Sell Stock I II III IV 解题报告
- [leetcode] 123. Best Time to Buy and Sell Stock III 解题报告
- [leetcode] 122. Best Time to Buy and Sell Stock II 解题报告
- [leetcode] 309. Best Time to Buy and Sell Stock with Cooldown 解题报告
- [leetcode] 188. Best Time to Buy and Sell Stock IV 解题报告
- leetcode 309. Best Time to Buy and Sell Stock with Cooldown 解题报告
- LeetCode 122. Best Time to Buy and Sell Stock II 解题报告
- JAVA 实现字符串倒序
- Struts2的全局返回配置
- spring mvc实现单点登录
- JavaEE开发之SpringMVC中的自定义拦截器及异常处理
- GD32F130FXP6学习笔记五:cortex-m3系列的启动过程
- [Leetcode] 121. Best Time to Buy and Sell Stock 解题报告
- C#NPOI读写Excel单元格的值的方法
- HTML事件属性
- UVA 1604 立体八数码问题——编码解码+哈希+dfs
- NX非常规入口调用
- MySQL error 1136:Column count doesn't match value count at row 1
- 煤球数目
- setBackground,setBackgroundColor,setBackgroundDrawable,setBackgroundResource的使用区别
- Android SQLite数据库—事务