LeetCode-121:Best Time to Buy and Sell Stock (一次股票交易最大利润)
来源:互联网 发布:慈溪行知职高地址全称 编辑:程序博客网 时间:2024/06/14 15:46
Question
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.
Idea
给定一个数组,其中的第i个元素为第i天给出的股票价格,求出一次交易利润。
对于这类问题,只需要对数组进行一次遍历,在遍历过程中记录利润,并在循环过程中保留最大利润即可。
Code
一次遍历—Java
public class Solution { public int maxProfit(int[] prices) { if(prices == null || prices.length == 0){ return 0; } int buy = prices[0]; int max = 0; for (int i=0; i<prices.length; i++){ if (prices[i] < buy){ buy = prices[i]; }else{ int profit = prices[i]-buy; if (max < profit){ max = profit; } } } return max; }}
- 处理过程中,要考虑数组为null的情况;
- 这里在遍历的过程中,一旦遇到价格大于买入价格,就计算利润,保留最大利润,避免两次for循环;
- 时间复杂度:O(n),空间复杂度:O(1)
阅读全文
0 0
- LeetCode-121:Best Time to Buy and Sell Stock (一次股票交易最大利润)
- LeetCode-122:Best Time to Buy and Sell Stock II (多次股票交易最大利润)
- Best Time to Buy and Sell Stock 股票交易最大收益
- Best Time to Buy and Sell Stock【找出最大利润】
- [leetcode 121] Best Time to Buy and Sell Stock---只能买卖股票一次的最大收益
- (LeetCode)Best Time to Buy and Sell Stock -- 求股票买卖的最大利润
- LeetCode--Best Time to Buy and Sell Stock(最大利润)Python
- Best Time to Buy and Sell Stock(股票交易)
- LeetCode 309. Best Time to Buy and Sell Stock with Cooldown(股票交易)
- leetcode 122. Best Time to Buy and Sell Stock II-股票交易|贪心算法
- [LeetCode]121. Best Time to Buy and Sell Stock(求近期股票能获得的最大利润)
- LeetCode-714:Best Time to Buy and Sell Stock with Transaction Fee (带有抛售费用的股票最大利润) -- medium
- 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 [121]
- LeetCode 121 Best Time to Buy and Sell Stock
- [leetcode 121] Best Time to Buy and Sell Stock
- c++ 零碎知识点
- UGUI与NGUI
- bzoj 1010
- SQL PLUS命令使用大全(转,特有用)
- DataGridView 保存布局文件到本地
- LeetCode-121:Best Time to Buy and Sell Stock (一次股票交易最大利润)
- JmDNS 多设备注册及查找
- Android逆向反调试练习
- opencv学习一: Fourier变换
- python中的单例
- bzoj 1296 [SCOI2009]粉刷匠 (dp)
- 六、tensorflow之添加层。
- 和大于S的最小子数组-LintCode
- ACdream 1157 Segments(cdq分治)