[LeetCode] 121. Best Time to Buy and Sell Stock ❤
来源:互联网 发布:软件部署结构图 编辑:程序博客网 时间:2024/06/06 02:03
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.
______________________________________________ 题目
写了两次,第一版两次循环有一个样例time limited了;第二次改成一次循环
第二版思路:每天的价格既可以是买入价也可以是卖出价,所以每次循环,如果可以就更新最低买入价;否则,就更新最大收入(如果可以)
int maxProfit(vector<int>& prices) { if (prices.empty()) return 0; int max = 0; for (int i = 0; i < prices.size() - 1; ++i) { for (int j = i + 1; j < prices.size(); ++j) { if (prices[i] < prices[j]) { if (prices[j] - prices[i] > max) max = prices[j] - prices[i]; } } } return max; }
int maxProfit(vector<int>& prices) { if (prices.empty() || prices.size() == 1) return 0; int max = 0; int min = prices[0]; for (int i = 1; i < prices.size(); ++i) { if (prices[i] < min) { min = prices[i]; } else { if (prices[i] - min > max) max = prices[i] - min; } } return max; }
阅读全文
0 0
- [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] 121. Best Time to Buy and Sell Stock
- 121. Best Time to Buy and Sell Stock LeetCode
- [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 *** 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
- 121.[Leetcode]Best Time to Buy and Sell Stock
- leetcode 121. Best Time to Buy and Sell Stock
- hdu5319 Painter(模拟题)
- 省选专练ZJOI2004书架
- redis的安装及jedis的jar包下载地址
- 三元组,二元组,排列组合
- NO1 拷贝构造函数
- [LeetCode] 121. Best Time to Buy and Sell Stock ❤
- [luogu]P1631序列合并-堆排的套路运用
- Android:WebView的全面解析
- JavaScript基础(3)—— Javascript事件
- 咸鱼日记12.11——springboot
- Java的两个高精度计算的类:BigInteger,BigDecimal
- Hadoop自学笔记之:reduce端利用辅助排序手动实现连接
- pyqt播放视频不能显示
- 如何提高自己的工作舒适度