best-time-to-buy-and-sell-stock leetcode C++
2024-09-08 06:11:28
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.
C++
class Solution {
public:
int maxProfit(vector<int> &prices) {
if(prices.size() < 2) return 0;
int maxPro = 0;
int curMin = prices[0];
for(int i =1; i < prices.size();i++){
if (prices[i] < curMin)
curMin = prices[i];
else
maxPro = max(prices[i] - curMin,maxPro);
}
return maxPro;
}
int maxProfit4(vector<int> &prices) {
if(prices.size() < 2) return 0;
int maxPro = 0;
int curMin = prices[0];
for(int i =1; i < prices.size();i++){
int cur = prices[i];
if (cur < curMin)
curMin = cur;
else{
int curPro = cur - curMin;
if (curPro > maxPro)
maxPro = curPro;
}
}
return maxPro;
}
int maxProfit2(vector<int> &prices) {
if(prices.size() < 2) return 0;
int maxPro = 0;
int curMin = prices[0];
for(int i =1; i < prices.size();i++){
if (prices[i] < curMin)
curMin = prices[i];
else
if (prices[i] - curMin > maxPro)
maxPro = prices[i] - curMin;
}
return maxPro;
}
};
最新文章
- linux笔记
- ShareSDK分享失败的原因
- 查看html元素绑定的事件与方法的利器
- printf的题目
- C# 操作鼠标移动到指定的屏幕位置方法
- 字典树(Trie树)实现与应用
- SVN与TortoiseSVN实战:TortoiseSVN新建及合并分支
- gem 相关命令
- [转] 详解http和https的作用与区别
- JavaSE思维导图(三)
- js获取控件位置
- spring的jar各包作用
- SQL报错盲注
- linux日常使用指令总结
- VS2010 配置与调试
- MQTT研究之EMQ:【SSL双向验证】
- oracle select in超过1000条报错解决方法
- 索引堆(Index Heap)
- Android为TV端助力 doc里面adb连接出现问题的解决方法
- CSS魔法堂:更丰富的前端动效by CSS Animation