121. Best Time to Buy and Sell Stock (Array；DP)
2024-09-19 00:29:30
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.
思路：注意不能简单地将最大值-最小值。卖必须发生在买之后，最小值得在最大值之前。记录下到当前为止最小值。
class Solution {
public:
int maxProfit(vector<int> &prices) {
if(prices.empty()) return ;
int maxProfit = ;
int min = INT_MAX;
int profit;
for(vector<int>::iterator it = prices.begin(); it < prices.end(); it ++)
{
if ((*it)<min)
{
min = *it;
}
else
{
profit = *it - min;
if(profit > maxProfit)
{
maxProfit = profit;
}
}
}
return maxProfit;
}
};
最新文章
- spring boot启用tomcat ssl
- (转)提高mysql千万级大数据SQL查询优化30条经验（Mysql索引优化注意）
- encfs创建时fuse: failed to exec fusermount: Permission denied错误解决
- opencv学习笔记（05）——操作相邻区域
- 纯tarjan poj2186
- javascript之数据推送
- PHP PDO 简单登陆操作
- html中行内元素与块级元素的区别。
- HDU 5795 A Simple Nim
- webpack-react之webpack篇(http://www.jianshu.com/p/794d573d2c53)
- EM算法原理总结
- [HNOI2009]通往城堡之路
- RabbitMQ入门：认识并安装RabbitMQ（以Windows系统为例）
- Redis 配置内容总结
- mongo 的导入和导出
- phpcms网页替换验证码功能 及 搜索功能
- vmware 里MAC 鼠标能移动 无法单击
- ZOJ2836-Number Puzzle-容斥原理
- db2 查询表前几行
- [转]web高级开发的成长之路